Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints

DOI10.1287/moor.2015.0749zbMath1338.90289OpenAlexW2181068997MaRDI QIDQ2806828

Prékopa, András, Kunikazu Yoda

Publication date: 19 May 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/30b1304f9c444900ab3d603e85a152eb6e40fed6

zbMATH Keywords

stochastic programmingconvexitylog-concavitychance constraintsprobabilistic constraintsmultidimensional 0-1 knapsack problem

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Cutting and packing problems under uncertainty: literature review and classification framework, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness

Uses Software

• KNITRO
• SNOPT
• CPLEX
• OR-Library
• GAMS
• NEOS

Cites Work

• Unnamed Item
• Unnamed Item
• The Pricing of Options and Corporate Liabilities
• Easy distributions for combinatorial optimization problems with probabilistic constraints
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Convexity of chance constraints with independent random variables
• The use of discrete moment bounds in probabilistic constrained stochastic programming models
• The multidimensional 0-1 knapsack problem: an overview.
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Distributionally robust joint chance constraints with second-order moment information
• Stochastic binary problems with simple penalties for capacity constraints violations
• Constraints in container loading -- a state-of-the-art review
• Computationally Manageable Combinational Auctions
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• A survey of effective heuristics and their application to a variety of knapsack problems
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• A Stochastic Programming Model
• The Theory and Computation of Knapsack Functions
• Association of Random Variables, with Applications
• On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite