Theorem 2 (v) — (HLP) has a strictly self-complementary solution
ProvedSelfDualLP.Output.theorem_2_vinterior-point-methodslinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1self-dual-embedding
Let , , , and let , (componentwise) and be arbitrary. Then the homogeneous self-dual program (HLP) built from these data has an optimal solution such that
which is called a strictly self-complementary solution.
This is the Goldman–Tucker strict complementarity property for (HLP). Combined with Theorem 3 it either produces optimal solutions of (LP) and (LD) or certifies infeasibility; in the proof of Theorem 8 it supplies an optimal solution with when (LP) has no optimal solution.
Preamble
import Mathlib import Definitions.Def_SelfDualLP_Complexity_LPData import Definitions.Def_SelfDualLP_Output_HLP import Definitions.Def_SelfDualLP_Output_Neighborhood import Definitions.Def_SelfDualLP_Output_PCSequence open Matrix
Formal statement
namespace SelfDualLP.Output
/-- Theorem 2 (v) (p. 57). For any `x⁰ > 0`, `s⁰ > 0` and `y⁰`, (HLP) has an optimal solution
`(y*, x*, τ*, θ* = 0, s*, κ*) ∈ 𝓕_h` with `(x* + s*; τ* + κ*) > 0`: a strictly
self-complementary solution. -/
theorem theorem_2_v {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
(x0 : Fin n → ℝ) (y0 : Fin m → ℝ) (s0 : Fin n → ℝ)
(hx0 : ∀ j, 0 < x0 j) (hs0 : ∀ j, 0 < s0 j) :
∃ z : HLPPoint m n, StrictlySelfComplementary A b c x0 y0 s0 z := by sorry
end SelfDualLP.Output
Source
Ye, Todd, Mizuno, An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm, Math. Oper. Res. 19(1) (1994), p. 57, Theorem 2 (v); DOI 10.1287/moor.19.1.53
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.