Proof of Proposition 4, (25), p. 24 — weak duality f∗ ≤ g_D between (P) and (D)
ProvedOnlineOvertime.HOOPBOT.weak_dualitylp-dualityovertimep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1primal-dualscheduling
Let an instance satisfy the standing assumptions. If is feasible for the offline integer program (P) and is feasible for the dual (D), then
Applied to an optimal offline solution and to the dual produced by Algorithm 1, this is the inequality used in (25) to bound the competitive ratio.
Preamble
import Mathlib import Definitions.Def_OnlineOvertime_HOOPBOT_Model
Formal statement
namespace OnlineOvertime.HOOPBOT
/-- Weak duality, proof of Proposition 4, (25), p. 24: the objective (2) of every feasible point
of (P) is at most the objective (7) of every feasible point of (D), so `f∗ ≤ g_D`. -/
theorem weak_duality {n T m : ℕ} (I : Instance n T m) (hS : I.Standing)
(y : Fin m → Fin n → Fin T → ℝ) (v : Fin n → Fin T → ℝ)
(x u : Fin n → Fin T → ℝ) (z : Fin m → ℝ)
(hP : Feasible I y v) (hD : DualFeasible I x u z) :
obj I y v ≤ dualObj I x u z := by sorry
end OnlineOvertime.HOOPBOT
Source
Keyvanshokooh, Shi, Van Oyen, Online Advance Scheduling with Overtime: A Primal-Dual Approach, accepted manuscript (MSOM, accepted May 2019; SSRN 3352166), p. 24, proof of Proposition 4, (25): 'By weak duality, we have f∗ ≤ gD'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.