2 papers
math.OC2026
Simultaneous Group-Envelope Bounds for -Robust Multiple-Choice Knapsack Problems
Zi Yuan Eric Shao
Many robust planning problems are solved by checking a family of ordinary optimization problems, one for each uncertainty threshold. Repeatedly building and solving those relaxatio…
math.OC2026
A Certifying MCKP Framework for -Robust Discrete Pricing
Zi Yuan Eric Shao
We study finite-menu portfolio pricing under a ratio margin requirement, price-admissibility constraints, and integer-budget demand uncertainty. The pricing model reduces exactly t…