Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inexact LP with hypersphere uncertainty is the LP with columns aⱼ + ρⱼ·e

Proved
SoysterInexactLP.Auxiliary.hyperBall_lp

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let A0=(a1,…,an)A_0=(a_1,\dots,a_n)A0​=(a1​,…,an​) be an m×nm\times nm×n matrix, ρ1,…,ρn≥0\rho_1,\dots,\rho_n\ge0ρ1​,…,ρn​≥0, b∈Rmb\in\mathbb R^mb∈Rm, and let KjK_jKj​ be the Euclidean ball of radius ρj\rho_jρj​ around aja_jaj​. Then xxx is feasible for (Ib) with these activity sets if and only if

x1(a1+ρ1e)+x2(a2+ρ2e)+⋯+xn(an+ρne)≤bandxj≥0 ∀j,x_1(a_1+\rho_1 e)+x_2(a_2+\rho_2 e)+\cdots+x_n(a_n+\rho_n e)\le b\qquad\text{and}\qquad x_j\ge0\ \forall j,x1​(a1​+ρ1​e)+x2​(a2​+ρ2​e)+⋯+xn​(an​+ρn​e)≤bandxj​≥0 ∀j,

where eee is the vector of all ones. Consequently, for every objective ccc, the optimal solutions of (Ib) are exactly the optimal solutions of

max⁡c⋅xs.t.x1(a1+ρ1e)+⋯+xn(an+ρne)≤b, xj≥0.\max c\cdot x\quad\text{s.t.}\quad x_1(a_1+\rho_1 e)+\cdots+x_n(a_n+\rho_n e)\le b,\ x_j\ge0.maxc⋅xs.t.x1​(a1​+ρ1​e)+⋯+xn​(an​+ρn​e)≤b, xj​≥0.

This is the paper's application: a linear program whose activity vectors are known only up to a ball of radius ρj\rho_jρj​ is solved by an ordinary linear program with inflated columns.

Formalization Note "Optimal solution" means a feasible point attaining the maximum of c⋅xc\cdot xc⋅x over the feasible set. The norm is Euclidean and the radii are nonnegative.

Preamble
import Mathlib
import Definitions.Def_SoysterInexactLP_Auxiliary_Problems
open Pointwise Matrix
Formal statement
namespace SoysterInexactLP.Auxiliary

theorem hyperBall_lp {m n : ℕ} (A₀ : Matrix (Fin m) (Fin n) ℝ)
    (ρ : Fin n → ℝ) (hρ : ∀ j, 0 ≤ ρ j) (b : Fin m → ℝ) :
    {x | FeasibleIb (hyperBall A₀ ρ) b x} =
        {x | (∀ j, 0 ≤ x j) ∧ ∑ j, x j • (fun i => A₀ i j + ρ j) ≤ b} ∧
      ∀ c x : Fin n → ℝ,
        IsOptimal (FeasibleIb (hyperBall A₀ ρ) b) c x ↔
          IsOptimal (fun y => (∀ j, 0 ≤ y j) ∧ ∑ j, y j • (fun i => A₀ i j + ρ j) ≤ b) c x := by sorry

end SoysterInexactLP.Auxiliary
Source
Soyster, Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research 21 (1973), p. 1157 (PDF p. 5), §Inexact Linear Programming, last display
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me