Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (39) — the transformed P-model feasible set is convex

Proved
ChanceDetEquiv.PModel.convex_39

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

chance-constrained-programmingconvex-optimizationfractional-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

For positive row and decision dimensions, P-model data and integrable moments, let F39F_{39}F39​ contain all (Dˉ,vˉ,vˉ0,wˉ0,t)(\bar D,\bar v,\bar v_0,\bar w_0,t)(Dˉ,vˉ,vˉ0​,wˉ0​,t) satisfying every constraint of program (39), including wˉ0=1\bar w_0=1wˉ0​=1, t≥0t\ge0t≥0, and all vˉi≥0\bar v_i\ge0vˉi​≥0. Then

F39 is a convex subset of the product space of its decision variables.F_{39}\text{ is a convex subset of the product space of its decision variables.}F39​ is a convex subset of the product space of its decision variables.

The claim includes points with t=0t=0t=0, which are needed when comparing suprema of the two programs.

Formalization Note The fourth constraint uses vˉi2≥Ki2(σˉi2−μˉi2)\bar v_i^2\ge K_i^2(\bar\sigma_i^2-\bar\mu_i^2)vˉi2​≥Ki2​(σˉi2​−μˉ​i2​) with σˉi2\bar\sigma_i^2σˉi2​ the raw second moment in (39b), not the centered variance. The paper's Ki=Φ−1(αi)K_i=\Phi^{-1}(\alpha_i)Ki​=Φ−1(αi​) has αi∈(1/2,1)\alpha_i\in(1/2,1)αi​∈(1/2,1), and the row residuals have Gaussian laws.

Preamble
import Definitions.Def_ChanceDetEquiv_PModel_Model
Formal statement
namespace ChanceDetEquiv.PModel

open MeasureTheory

/-- The feasible set of the transformed P-model program (39), including t = 0, is convex. -/
theorem convex_39 {Ω : Type*} [MeasurableSpace Ω] {m n : ℕ}
    (d : Model Ω m n) [IsProbabilityMeasure d.P]
    (hm : 0 < m) (hn : 0 < n)
    (hMoments : MomentAssumptions d) (hNormal : NormalRows d)
    (hConfidence : Confidence d) :
    Convex ℝ (feasible39 d) := by sorry

end ChanceDetEquiv.PModel
Source
Charnes and Cooper, Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints, Oper. Res. 11 (1963), pp. 32–33, Eqs. (39)–(39b) and paragraph after (39b); https://doi.org/10.1287/opre.11.1.18
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