§4.1 claim (b), p. 1431 — U-PIT admits a unique minimal optimal solution
ProvedOpenPitMIP.UltPit.upit_unique_minimal_optimallinear-programmingmaximum-closurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ultimate-pit-limit
Let be the cluster values of a PCPSP-C instance, and consider the ultimate pit limit problem
Then U-PIT has exactly one minimal optimal solution: there is a unique optimal such that every optimal (componentwise) equals .
Theorem 1 speaks of "the" minimal optimal solution of U-PIT; this claim is what makes the article well defined there.
Formalization Note The paper cites this property of maximum closure problems (Hochbaum 2008) rather than proving it. The statement needs at least one destination, so that exists. It holds for every instance, with no standing assumption, so none is stated.
Preamble
import Mathlib import Definitions.Def_OpenPitMIP_UltPit_Setting
Formal statement
namespace OpenPitMIP.UltPit
open PCPSPC
/-- §4.1 claim (b), p. 1431: the ultimate pit limit problem U-PIT (12)–(14) admits a unique
minimal optimal solution. -/
theorem upit_unique_minimal_optimal {B D C : Type} [Fintype B] [Fintype D] [Fintype C]
[Nonempty D] {T m : ℕ} (I : PCPSPC B D C T m) :
∃! x : C → ℝ, I.UPitMinimalOptimal x := by sorry
end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §4.1, claim (b), p. 1431
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.