§4.1, p. 1431 — the total extraction x¹ of a feasible PCPSP-C solution is feasible for U-PIT
ProvedOpenPitMIP.UltPit.x1_feasible_upitopen-pit-miningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ultimate-pit-limit
Consider an instance of the PCPSP-C under the standing assumptions of §2.1 and a feasible solution under either integrality condition. Define, for each cluster ,
Then is feasible for the ultimate pit limit problem U-PIT: for every arc , and for every cluster .
This is what makes the pit limit of a PCPSP-C solution, the support of , comparable with the pit limit of U-PIT in Theorem 1.
Formalization Note The paper states this for a minimal optimal solution and justifies it by constraints (4) alone; the statement here assumes only feasibility, which is stronger. The bound uses that every cluster contains a block (standing assumption), so that .
Preamble
import Mathlib import Definitions.Def_OpenPitMIP_UltPit_Setting
Formal statement
namespace OpenPitMIP.UltPit
open PCPSPC
/-- §4.1, p. 1431: for a feasible solution `(x, y)` of the PCPSP-C, the vector
`x¹_c = ∑_{t ∈ 𝒯} x_{c,t}` is feasible for U-PIT (12)–(14). -/
theorem x1_feasible_upit {B D C : Type} [Fintype B] [Fintype D] [Fintype C] {T m : ℕ}
(I : PCPSPC B D C T m) (hI : I.Standing) (κ : Integrality)
(x : C → Fin T → ℝ) (y : B → D → Fin T → ℝ) (hxy : I.Feasible κ x y) :
I.UPitFeasible (fun c => ∑ t, x c t) := by sorry
end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §4.1, p. 1431
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.