Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 1427 — under (10) or (11) the PCPSP-C has an optimal solution whenever it is feasible

Proved
OpenPitMIP.UltPit.exists_optimal

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

existence-of-optimummixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1production-scheduling

Consider an instance of the PCPSP-C (formulation (1)–(7)) under the standing assumptions of §2.1, with either the full integrality condition (10) or the partial integrality condition (11). If the PCPSP-C has a feasible solution, then it has an optimal solution: a feasible (x∗,y∗)(x^*, y^*)(x∗,y∗) with

∑b∑d∑tpb,d,t yb,d,t≤∑b∑d∑tpb,d,t yb,d,t∗\sum_{b}\sum_{d}\sum_{t} p_{b,d,t}\, y_{b,d,t} \le \sum_{b}\sum_{d}\sum_{t} p_{b,d,t}\, y^*_{b,d,t}b∑​d∑​t∑​pb,d,t​yb,d,t​≤b∑​d∑​t∑​pb,d,t​yb,d,t∗​

for every feasible (x,y)(x, y)(x,y).

The paper derives this from the boundedness of the feasible set; it guarantees that the minimal optimal solutions of Theorem 1 are about a nonempty set of optima.

Formalization Note Boundedness of the feasible set relies on every cluster being nonempty (standing assumption), which forces x≥0x \ge 0x≥0.

Preamble
import Mathlib
import Definitions.Def_OpenPitMIP_UltPit_Setting
Formal statement
namespace OpenPitMIP.UltPit

open PCPSPC

/-- §2.1, p. 1427: under either integrality condition (10) or (11) the PCPSP-C has a bounded
feasible set, so an optimal solution exists whenever the feasible set is nonempty. -/
theorem exists_optimal {B D C : Type} [Fintype B] [Fintype D] [Fintype C] {T m : ℕ}
    (I : PCPSPC B D C T m) (hI : I.Standing) (κ : Integrality)
    (hfeas : ∃ x y, I.Feasible κ x y) :
    ∃ x y, I.Optimal κ x y := by sorry

end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §2.1, p. 1427
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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