Eq. (39a) — feasible forward substitution and preserved objective
ProvedChanceDetEquiv.PModel.forward_39achance-constrained-programmingfractional-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perspective-transform
For positive row and decision dimensions, let satisfy the corrected P-model program (38), with . Set and , , , . Then the transformed point satisfies every constraint of (39), and
Thus every attainable fractional objective value in (38) is attained by the convex program (39).
Formalization Note The definitions use actual expected squares from (30), (34), and (39b). The paper leaves the scaling of implicit when it changes the objective to ; it is made explicit here. Component moments are integrable, and . Each row residual is assumed Gaussian, as in the source.
Preamble
import Definitions.Def_ChanceDetEquiv_PModel_Model
Formal statement
namespace ChanceDetEquiv.PModel
open MeasureTheory
/-- The substitution (39a) sends every feasible point of (38) into (39), preserving its objective. -/
theorem forward_39a {Ω : 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)
(p : Point38 m n) (hp : p ∈ feasible38 d) :
forward p ∈ feasible39 d ∧ value39 (forward p) = value38 p := by sorry
end ChanceDetEquiv.PModel
Source
Charnes and Cooper, Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints, Oper. Res. 11 (1963), p. 32, Eq. (39a) and preceding paragraph; https://doi.org/10.1287/opre.11.1.18
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.