App. C.6, p. 344 — for mid-point re-solving (before the last re-solve)
ProvedChoicePAC.MidPoint.midpoint_G_boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-loss-bound
Consider the mid-point schedule of the -th system, , , with the smallest integer such that . For every and every with ,
This estimate is what turns the general bound (8) into the constant bound of Theorem 5.2.
Formalization Note The page asserts the bound "for all ". That is false on : for , , and , . The display's own range uses , valid only for , so the corrected statement covers . For there is no re-solve () and the range is empty.
Preamble
import Mathlib import Definitions.Def_ChoicePAC_MidPoint_Model import Definitions.Def_ChoicePAC_MidPoint_GF
Formal statement
namespace ChoicePAC.MidPoint
theorem midpoint_G_bound (k : ℕ) (hk : 1 ≤ k) (t : ℝ) (ht0 : 0 ≤ t)
(ht : t < (midpointSchedule k).time (midpointSchedule k).M) :
(midpointSchedule k).G t ≤ 4 * (1 - t) := by sorry
end ChoicePAC.MidPoint
Source
Jasin, Kumar, A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice, Math. Oper. Res. 37(2), 2012, App. C.6, p. 344, first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.