In the following section, we solve linear programmes (LPs). The well-known simplex method is described, together with the maximally quadratic and furthermore strongly polynomial normal method as a solution of Smale's 9th problem. We may generalise the normal method to (non-) convex programmes (with vector-valued functions). The diameter theorem for polytopes is proven. It is shown that (mixed) integer LPs are polynomial.

Proof and algorithm: Let M := {x ∈ ^{κ}ℝ^{n} : Ax ≤ b, b ∈ ^{κ}ℝ^{m}, A ∈ ^{κ}ℝ^{m×n}, m, n ∈ ^{κ}ℕ*} be the feasible domain of the LP max {c^{T}x : c ∈ ^{κ}ℝ^{n}, x ∈ M}. By taking the dual or setting x := x^{+} - x^{-} with x^{+}, x^{-} ≥ 0, we obtain x ≥ 0. We first solve max {-z : Ax - b ≤ (z, …, z)^{T} ∈ ^{κ}ℝ^{m}, z ≥ 0} to obtain a feasible x when b ≥ 0 does not hold. Initial and target value are z := |min {b_{1}, ..., b_{m}}| resp. z = 0 and we begin with x := 0 as in the first case. Pivoting if necessary, we may assume that b ≥ 0.

Let i, j, k ∈ ^{κ}ℕ* and let a_{i}^{T} the i-th row vector of A. If c_{j} ≤ 0 for all j, the LP is solved. If for some c_{j} > 0, a_{ij} ≤ 0 for all i, the LP is positively unbounded. Otherwise, we divide all a_{i}^{T}x ≤ b_{i} by ||a_{i}|| and all c_{j} and a_{ij} by the minimum of |a_{ij}| such that a_{ij} ≠ 0 for each j. This will be reversed later. If necessary, renormalise by ||a_{i}||. This yields good runtime performance even on strongly deformed polytopes.

In each step, we can remove multiple constraints and such with a_{i} ≤ 0, since they are redundant (avoidable by adding an extra slack variable in each case). The second case is analogous. If in both cases b_{i} = 0 and a_{i} ≥ 0 for some i, then the LP has maximum 0 and solution x = 0 if b ≥ 0, otherwise it has no solutions. In each step, for each c_{j} > 0 and non-base variable x_{j}, we select the minimum ratio b_{k}/a_{kj} for a_{ij} > 0.

The variables with * are considered in the next step. The next potential vertex is given by x_{j}* = x_{j} + b_{k}/a_{kj} for feasible x*. To select the steepest edge, select the pivot a_{kj} corresponding to x_{j} that maximises c^{T}(x* - x)/||x* - x|| i.e. c_{j}|c_{j}|/(1 + Σ a_{ij}^{2}) in the k-th constraint. If there are multiple maxima, select max c_{j}b_{k}/a_{kj} or alternatively the smallest angle min Σ c_{j}*/||c*||, according to the rule of best pivot value.

If there are more than n values b_{i} equal 0 and we cannot directly maximise the objective function, we relax (perturb) the constraints with b_{i} = 0 by the same, minimal modulus. These do not need to be written into the tableau: We simply set b_{i} = ||a_{i}||. If another multiple vertex is encountered, despite this being unlikely, simply increase the earlier b_{i} by ||a_{i}||.

The cost of eliminating a multiple vertex, after which we revert the relaxation, corresponds to the cost of solving an LP with b = 0. The same task is potentially required at the end of the process when checking whether the LP admits any other solutions if at least two of the c_{j} are 0. Along the chosen path, the objective function increases (effectively) strictly monotonically. We can then simply calculate c_{j}*, a_{ij}* and b_{i}* using the rectangle rule.

In the worst-case scenario, the simplex method is not strongly polynomial despite the diameter formula for polytopes (see below) under any given set of pivoting rules, since an exponential "drift" can be constructed with Klee-Minty or Jeroslow polytopes, or others, creating a large deviation from the shortest path by forcing the selection of the least favourable edge. This is consistent with existing proofs. The result follows.⃞

Theorem: The strongly polynomial normal method solves the LP in at most O(mn), if possible.

Proof and algorithm: We compute the LP min {h ∈ ^{κ}ℝ_{≥0} : ±(c^{T}x - b^{T}y) ≤ h, 0 ≤ x ∈ ^{κ}ℝ^{n}, 0 ≤ y ∈ ^{κ}ℝ^{m}, Ax - b ≤ (h, …, h)^{T} ∈ ^{κ}ℝ^{m}, c - A^{T}y ≤ (h, …, h)^{T} ∈ ^{κ}ℝ^{n}} via the (dual) programme min {b^{T}y : 0 ≤ y ∈ ^{κ}ℝ^{m}, A^{T}y ≥ c} for the (primal) programme max {c^{T}x : c ∈ ^{κ}ℝ^{n}, x ∈ M_{≥0}}. Initial and target value of the *height* h are |min {b_{1}, ..., b_{m}, -c_{1}, …, -c_{n}}| resp. 0. To obtain max h* from h, we normalise ±(c^{T}x - b^{T}y) ≤ h, Ax ≤ b and A^{T}y ≥ c. We begin with x := 0 and y := 0.

Generally, we may extrapolate h*, x* und y* in O(m + n) from preceding results. We twice successively define all x_{j}* := (max x_{j} + min x_{j})/2 and y_{i}* := (max y_{i} + min y_{i})/2. Then, we minimise h, if possible; otherwise, we stop. Thus, we have finished one iteration step in O(mn). Since we process h independently from m and n, plus separately from all other variables x_{j}* and y_{i}* in O(ln(max h*/r)) with computational accuracy r ∈ ^{κ}ℝ_{>0}, the claim follows.⃞

Remarks: When we cannot leave x or y, we relax all constraints except 0 ≤ x and 0 ≤ y by O(r) and undo that at the end of one iteration step. We can use mutatis mutandis other initial values for h, x and y, where favourable. The procedure is permitted by the strong duality theorem. We easily may determine O(r) and O(ln(max h*/r)) experimentally dependent from computer or problem.

Corollary: Every linear system (LS) of equations Ax = b with x ∈ ^{κ}ℝ^{n} may be solved in at most O(mn), provided that a solution exists.

Proof: We write Ax = b as Ax ≤ b and -Ax ≤ -b where x = x^{+} - x^{-} with x^{+}, x^{-} ≥ 0.⃞

Theorem: Every convex programme min {f_{1}(x) : 0 ≤ x ∈ ^{κ}ℝ^{n}, (f_{2}(x), …, f_{m}(x))^{T} ≤ 0} where the f_{i} ∈ ^{κ}ℝ are convex posynomials is strongly polynomial and may be solved by the normal method and Newton's method, which handles the f_{i}, in at most O(p), assuming that it is solvable, where p ∈ ^{κ}ℕ* denotes the number of operands x_{j} of the f_{i} and the objective function f_{1} is linearised.

Proof: The claim follows from the existence of the normal method.⃞

Remarks: The normal method is currently the fastest known LS/LP-solving algorithm and is numerically very stable, since the initial data are barely altered. It may also be applied to branch and bound, in particular for nonconvex optimisation. It can be paralleled like the simplex method. It can easily be extended to convex programmes with vector-valued or other convex f_{i}.

Diameter theorem for polytopes: The diameter of a n-dimensional polytope defined by m constraints with m, n ∈ ^{κ}ℕ* is at most max(2(m - n), 0).

Proof: Each vertex of a (potentially deformed) hypercube is formed by at most n hyperplanes. If we complete the polytope by adding or removing hyperplanes, the claim follows for the chosen path, since each step adds at most two additional edges. This theorem can be extended to polyhedra analogously by dropping the requirement of finiteness.⃞

Further thoughts: Gomory or Lenstra cuts can find an integer solution of the original problem in polynomial time if we additionally assume that a, b, and c are integers wlog and that m and n are fixed. By dualising, a full-dimensional LP may be obtained as described before within the normal method. This shows that the problem of (mixed) integer linear programming is not NP-complete:

Theorem: (Mixed) integer LPs may be solved in polynomial time.⃞

code of simplex method and data file example

© 27.11.2017 by Boris Haase

• disclaimer • mail@boris-haase.de • pdf-version • bibliography • subjects • definitions • statistics • php-code • rss-feed • top