Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraints
Xinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee
Abstract
Predict+Optimize is a recently proposed framework which combines machine learning and constrained optimization, tackling optimization problems that contain parameters that are unknown at solving time. The goal is to predict the unknown parameters and use the estimates to solve for an estimated optimal solution to the optimization problem. However, all prior works have focused on the case where unknown parameters appear only in the optimization objective and not the constraints, for the simple reason that if the constraints were not known exactly, the estimated optimal solution might not even be feasible under the true parameters. The contributions of this paper are two-fold. First, we propose a novel and practically relevant framework for the Predict+Optimize setting, but with unknown parameters in both the objective and the constraints. We introduce the notion of a correction function, and an additional penalty term in the loss function, modelling practical scenarios where an estimated optimal solution can be modified into a feasible solution after the true parameters are revealed, but at an additional cost. Second, we propose a corresponding algorithmic approach for our framework, which handles all packing and covering linear programs. Our approach is inspired by the prior work of Mandi and Guns, though with crucial modifications and re-derivations for our very different setting. Experimentation demonstrates the superior empirical performance of our method over classical approaches.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a2311991-035c-4903-a9a6-b6c8d791b0e3Cited by top-tier papers5
- Two-Stage Predict+Optimize for MILPs with Unknown Parameters in ConstraintsXinyi Hu, Jasper C. H. Lee, Jimmy Ho-Man LeeNeurIPS 2023 · 15 citations
- Multi-Stage Predict+Optimize for (Mixed Integer) Linear ProgramsXinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee, Peter J. StuckeyNeurIPS 2024 · 9 citations
- Feasibility-Aware Decision-Focused Learning for Predicting Parameters in the ConstraintsJayanta Mandi, Marianne Defresne, Senne Berden, Tias GunsNeurIPS 2025 · 9 citations
- DFF: Decision-Focused Fine-Tuning for Smarter Predict-Then-Optimize with Limited DataJiaqi Yang, Enming Liang, Zicheng Su, Zhichao Zou et al.AAAI 2025 · 6 citations
- Smart Surrogate Losses for Contextual Stochastic Linear Optimization with Robust ConstraintsHyungki Im, Wyame Benslimane, Paul GrigasNeurIPS 2025 · 3 citations
Builds on5
- Decision Trees for Decision-Making under the Predict-then-Optimize FrameworkAdam N. Elmachtoub, Jason Cheuk Nam Liang, Ryan McNellisICML 2020 · 140 citations
- Interior Point Solving for LP-based prediction+optimisationJayanta Mandi, Tias GunsNeurIPS 2020 · 138 citations
- CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming ConstraintsAnselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos et al.ICML 2021 · 73 citations
- Dynamic Programming for Predict+OptimiseEmir Demirovic, Peter J. Stuckey, Tias Guns, James Bailey et al.AAAI 2020 · 39 citations
- A Divide and Conquer Algorithm for Predict+Optimize with Non-convex ProblemsAli Ugur Guler, Emir Demirovic, Jeffrey Chan, James Bailey et al.AAAI 2022 · 14 citations
Related papers
- Smart Predict-and-Optimize for Hard Combinatorial Optimization ProblemsJayanta Mandi, Emir Demirovic, Peter J. Stuckey, Tias GunsAAAI 2020 · 184 citations
- Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+OptimizeXinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. ZhongNeurIPS 2022 · 7 citations
- Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear ProgrammingChunlin Sun, Shang Liu, Xiaocheng LiICML 2023 · 13 citations
- A Surrogate Objective Framework for Prediction+Programming with Soft ConstraintsKai Yan, Jie Yan, Chuan Luo, Liting Chen et al.NeurIPS 2021 · 6 citations
- Leaving the Nest: Going beyond Local Loss Functions for Predict-Then-OptimizeSanket Shah, Bryan Wilder, Andrew Perrault, Milind TambeAAAI 2024 · 22 citations
