A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
From MaRDI portal
Publication:2450736
DOI10.1016/j.orl.2013.08.008zbMath1287.90042OpenAlexW2034908516MaRDI QIDQ2450736
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.08.008
stochastic programmingsemidefinite programmingjoint probabilistic constraints\(0\)-\(1\) linear programcompletely positive problems
Related Items
Stochastic nonlinear resource allocation problem, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Chance constrained \(0-1\) quadratic programs using copulas, Bounds for probabilistic programming with application to a blend planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- On two-stage stochastic knapsack problems
- An integer programming approach for linear programs with probabilistic constraints
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
- Convexity of chance constraints with independent random variables
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- On joint probabilistic constraints with Gaussian coefficient matrix
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Some NP-complete problems in quadratic and nonlinear programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Chance-Constrained Programming with Joint Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Chance Constrained Programming with Joint Constraints
