Distributionally Robust Stochastic Knapsack Problem
Abstract
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of the information on random data is known, i.e., the first and second moment of the random variables, their joint support, and possibly an independence assumption. As for the binary constraints, special interest is given to the corresponding semidefinite programming (SDP) relaxation. While in the case that the model only has a single knapsack constraint we present an SDP reformulation for this relaxation, the case of multiple knapsack constraints is more challenging. Instead, two tractable methods are presented for providing upper and lower bounds (with its associated conservative solution) on the SDP relaxation. An extensive computational study is given to illustrate the tightness of these bounds and the value of the proposed distributionally robust approach.
Keywords
MSC codes
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
D. Bertsimas and M. Sim, \modifiedThe price of robustness, Oper. Res., 52 (2004), pp. 35--53.
2.
D. Bertsimas, K. Natarajan, and \modifiedC.-P. Teo, Probabilistic combinatorial optimization: Moments, semidefinite programming and asymptotic bounds, SIAM J. Optim., 15 (2004), pp. 185--209.
3.
A. Billionnet and F. Calmels, Linear programming for the $0$-$1$ quadratic knapsack problem, Eur. J. Oper. Res., 92 (1996), pp. 310--325.
4.
P. Brucker, An O(n) algorithm for quadratic knapsack problems, Oper. Res. Lett., 3 (1984), pp. 163--166.
5.
G. C. Calafiore and L. El Ghaoui, On distributionally robust chance-constrained linear programs, J. Optim. Theory Appl., 130 (2006), pp. 1--22.
6.
A. Caprara, D. Pisinger, and P. Toth, Exact solution of the quadratic knapsack problem, INFORMS J. Comput., 11 (1999), pp. 125--137.
7.
W. Chen, M. Sim, J. Sun, and C. P. Teo, From CVaR to uncertainty set: implications in joint chance constrained optimization, Oper. Res., 58 (2010), pp. 470--485.
8.
J. Cheng and A. Lisser, A second-order cone programming approach for linear programs with joint probabilistic constraints, Oper. Res. Lett., 40 (2012), pp. 325--328.
9.
E. Delage and Y. Ye, Distributionally robust optimization under moment uncertainty with application to data-driven problems, Oper. Res., 58 (2010), pp. 596--612.
10.
L. El Ghaoui, M. Oks, and F. Oustry, Worst-case value-at-risk and robust portfolio optimization: a conic programming approach, Oper. Res., 51 (2003), pp. 543--556.
11.
A. Gaivoronski, A. Lisser, and R. Lopez, Knapsack problem with probability constraints, \modifiedJ. Global Optim., 49 (2011), pp. 397--413.
12.
G. Gallo, P. Hammer, and B. Simeone, Quadratic knapsack problems, \modifiedMath. Program. Stud., 12 (1980), pp. 132--149.
13.
M. Grant and S. Boyd, CVX: MATLAB Software for Disciplined Convex Programming, Version 2.0 Beta http://cvxr.com/cvx (2012).
14.
M. Grant and S. Boyd, Graph Implementations for Nonsmooth Convex Programs, Recent Advances in Learning and Control, Lecture Notes in Control and Inform. Sci., Springer: Berlin, 2008.
15.
IBM ILOG, CPLEX Optimizer, http://www.ibm.com/software/integration/optimization/cplex/ http://www.ibm.com/software/integration/optimization/.
16.
E. Johnson, A. Mehrotra, and G. Nemhauser, Min-cut clustering, Math. Program., 62 (1993), pp. 133--152.
17.
P. Kouvelis and G. Yu, Robust Discrete Optimization and its Application, Kluwer Academic, Dordrecht, 1997.
18.
\modifiedH. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, Berlin, 2004.
19.
S. Kosuch and A. Lisser, Upper bounds for the stochastic knapsack problem and a B&B algorithm, \modifiedAnn. Oper. Res., 176 (2010), pp. 77--93.
20.
S. Kosuch and A. Lisser, On two-stage stochastic knapsack problems with or without probability constraint, Discrete Appl. Math., 159 (2011), pp. 1827--1841.
21.
M. Kress, M. Penn, and M. Polukarov, The minmax multidimensional knapsack problem with application to a chance-constrained problem, Naval. Res. Logist., 54 (2007), pp. 656--666.
22.
S. Liao, C. van Delft, and J. P. Vial, Distributionally robust workforce scheduling in call centers with uncertain arrival rates, Optim. Methods Softw., 28 (2013), pp. 501--522.
23.
A. Lisser and R. Lopez, Stochastic quadratic knapsack with recourse, Electron. Notes Discrete Math., 36 (2010), pp. 97--104.
24.
S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley, New York, 1990.
25.
M. Monaci and U. Pferschy, On the robust knapsack problem, SIAM J. Optim., 23 (2013), pp. 1956--1982.
26.
I. Pólik and T. Terlaky, A survey of the S-Lemma, SIAM Rev., 49 (2007), pp. 371--418.
27.
H. Scarf, A min-max solution of an inventory problem, in Studies in the Mathematical Theory of Inventory and Production, Stanford University Press, Stanford, CA, 1958, pp. 201--209.
28.
A. Shapiro, On the duality theory of conic linear problems, in Semi-Infinite Programming: Recent Advances, Kluwer Academic, Dordrecht, 2001, pp. 135--165.
29.
J. F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Method. Softw., 11--12 (1999), pp. 625--653.
30.
M. R. Wagner, Stochastic 0--1 linear programming under limited distributional information, Oper. Res. Lett., 36 (2008), pp. 150--156.
31.
\modifiedW. Wiesemann, D. Kuhn, and B. Rustem, Multi-resource allocation in stochastic project scheduling, Ann. Oper. Res., 193 (2012), pp. 193--220.
32.
W. Wiesemann, D. Kuhn, and M. Sim, Distributionally robust convex optimization, Oper. Res., to appear.
33.
K. Yoda and A. Prekopa, Convexity and Solutions of Stochastic Multidimensional Knapsack Problems with Probabilistic Constraints, Technical report Rutgers Center for Operations Research, New Brunswick, NJ, 2012.
34.
S. Zymler, D. Kuhn, and M. Rustem, Distributionally robust joint chance constraints with second-order moment information, Math. Program., 137 (2013), pp. 167--198.
Information & Authors
Information
Published In
Copyright
© 2014, Society for Industrial and Applied Mathematics.
History
Submitted: 12 June 2013
Accepted: 3 July 2014
Published online: 11 September 2014
Keywords
MSC codes
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- A Nonparametric Robust Optimization Approach for Chance-Constrained Knapsack ProblemSIAM Journal on Optimization, Vol. 35, No. 2 | 15 April 2025
- An Exact Algorithm for the Hazardous Orienteering ProblemNetworks, Vol. 34 | 4 April 2025
- Online-Learning-Enabled Distributionally Robust Motion Control via Uncertainty Propagation and Ambiguity Set Compression2024 IEEE 63rd Conference on Decision and Control (CDC) | 16 Dec 2024
- ALSO-X#: better convex approximations for distributionally robust chance constrained programsMathematical Programming, Vol. 162 | 15 October 2024
- Distributionally Robust Chance-Constrained Markov Decision Processes with Random PayoffApplied Mathematics & Optimization, Vol. 90, No. 1 | 26 July 2024
- Robust Combination Testing: Methods and Application to COVID-19 DetectionManagement Science, Vol. 70, No. 4 | 1 Apr 2024
- Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulationEuropean Journal of Operational Research, Vol. 313, No. 2 | 1 Mar 2024
- Distributionally robust joint chance-constrained programming with Wasserstein metricOptimization Methods and Software, Vol. 39, No. 1 | 8 August 2023
- Other Models for Robust OptimizationAn Introduction to Robust Combinatorial Optimization | 10 May 2024
- Modeling and Solving Robust Chance-Constrained Binary Programs Using Sample Average ApproximationsOptimization Essentials | 29 December 2024
- Distributionally robust production and replenishment problem for hydrogen supply chainsTransportation Research Part E: Logistics and Transportation Review, Vol. 179 | 1 Nov 2023
- A stochastic geometric programming approach for power allocation in wireless networksWireless Networks, Vol. 29, No. 5 | 14 March 2023
- Wasserstein distributionally robust chance-constrained program with moment informationComputers & Operations Research, Vol. 152 | 1 Apr 2023
- The hazardous orienteering problemNetworks, Vol. 81, No. 2 | 8 November 2022
- Distributionally robust joint chance-constrained support vector machinesOptimization Letters, Vol. 17, No. 2 | 31 March 2022
- Parallel Machine Scheduling Under Uncertainty: Models and Exact AlgorithmsINFORMS Journal on Computing, Vol. 34, No. 6 | 1 Nov 2022
- Distributionally Robust Chance Constrained Geometric OptimizationMathematics of Operations Research, Vol. 47, No. 4 | 1 Nov 2022
- Distribution-Free Approaches for an Integrated Cargo Routing and Empty Container Repositioning Problem with Repacking Operations in Liner Shipping NetworksSustainability, Vol. 14, No. 22 | 9 November 2022
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizationsEuropean Journal of Operational Research, Vol. 302, No. 2 | 1 Oct 2022
- Distributionally robust portfolio optimization with second-order stochastic dominance based on wasserstein metricInformation Sciences, Vol. 613 | 1 Oct 2022
- Exact algorithms for the 0–1 Time-Bomb Knapsack ProblemComputers & Operations Research, Vol. 145 | 1 Sep 2022
- A Distributionally Robust Scheduling Approach for Uncertain Steelmaking and Continuous Casting ProcessesIEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 52, No. 6 | 1 Jun 2022
- Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein AmbiguityINFORMS Journal on Computing, Vol. 34, No. 3 | 1 May 2022
- A Solution Approach to Distributionally Robust Joint-Chance-Constrained Assignment ProblemsINFORMS Journal on Optimization, Vol. 4, No. 2 | 1 Apr 2022
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problemInternational Transactions in Operational Research, Vol. 29, No. 2 | 15 July 2021
- Optimized Bonferroni approximations of distributionally robust joint chance constraintsMathematical Programming, Vol. 191, No. 1 | 5 November 2019
- Distributionally robust maximum probability shortest path problemJournal of Combinatorial Optimization, Vol. 43, No. 1 | 13 May 2021
- Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustnessEURO Journal on Computational Optimization, Vol. 10 | 1 Jan 2022
- Robust Combination Testing: Methods and Application to COVID-19 DetectionSSRN Electronic Journal, Vol. 5 | 1 Jan 2022
- Distributionally Robust Optimization: A review on theory and applicationsNumerical Algebra, Control & Optimization, Vol. 12, No. 1 | 1 Jan 2022
- Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approachesComputational Optimization and Applications, Vol. 80, No. 1 | 23 June 2021
- Games with distributionally robust joint chance constraintsOptimization Letters, Vol. 15, No. 6 | 19 January 2021
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metricJournal of Global Optimization, Vol. 79, No. 4 | 17 November 2020
- On distributionally robust chance constrained programs with Wasserstein distanceMathematical Programming, Vol. 186, No. 1-2 | 13 November 2019
- Parametric Scenario Optimization under Limited DataACM Transactions on Modeling and Computer Simulation, Vol. 30, No. 4 | 25 November 2020
- A sparse chance constrained portfolio selection model with multiple constraintsJournal of Global Optimization, Vol. 77, No. 4 | 17 March 2020
- CVaR-Based Approximations of Wasserstein Distributionally Robust Chance Constraints with Application to Process SchedulingIndustrial & Engineering Chemistry Research, Vol. 59, No. 20 | 29 April 2020
- Multivariate robust second-order stochastic dominance and resulting risk-averse optimizationOptimization, Vol. 68, No. 9 | 18 March 2019
- “Dice”-sion–Making Under Uncertainty: When Can a Random Decision Reduce Risk?Management Science, Vol. 65, No. 7 | 1 Jul 2019
- Closed-Form Optimal Portfolios of Distributionally Robust Mean-CVaR Problems with Unknown Mean and VarianceApplied Mathematics & Optimization, Vol. 79, No. 3 | 13 October 2017
- Optimization under uncertainty in the era of big data and deep learning: When machine learning meets mathematical programmingComputers & Chemical Engineering, Vol. 125 | 1 Jun 2019
- Ambiguous risk constraints with moment and unimodality informationMathematical Programming, Vol. 173, No. 1-2 | 24 November 2017
- Data-Driven Robust Chance Constrained Problems: A Mixture Model ApproachJournal of Optimization Theory and Applications, Vol. 179, No. 3 | 24 August 2018
- Exact algorithms for the chance-constrained vehicle routing problemMathematical Programming, Vol. 172, No. 1-2 | 3 May 2017
- Distribution-Free Model for Ambulance Location Problem with Ambiguous DemandJournal of Advanced Transportation, Vol. 2018 | 13 Sep 2018
- Distributionally Robust Optimization with Principal Component AnalysisSIAM Journal on Optimization, Vol. 28, No. 2 | 14 June 2018
- On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization ProblemsSIAM Journal on Optimization, Vol. 28, No. 2 | 24 April 2018
- Bounds for Random Binary Quadratic ProgramsSIAM Journal on Optimization, Vol. 28, No. 1 | 13 March 2018
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance InformationSIAM Journal on Optimization, Vol. 28, No. 4 | 9 October 2018
- Environmental safety construction programs optimization and reliability of their implementationMATEC Web of Conferences, Vol. 193 | 20 August 2018
- Data-Driven Distributionally Robust Chance-Constrained Optimization With Wasserstein MetricSSRN Electronic Journal, Vol. 18 | 1 Jan 2018
- Distributionally robust chance-constrained games: existence and characterization of Nash equilibriumOptimization Letters, Vol. 11, No. 7 | 9 September 2016
- Minimum cost dominating tree sensor networks under probabilistic constraintsComputer Networks, Vol. 112 | 1 Jan 2017
- New reformulations of distributionally robust shortest path problemComputers & Operations Research, Vol. 74 | 1 Oct 2016
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networksJournal of Scheduling, Vol. 19, No. 3 | 21 July 2015
- Generalized Gauss inequalities via semidefinite programmingMathematical Programming, Vol. 156, No. 1-2 | 12 March 2015
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].