Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
DOI10.1007/S11590-011-0341-ZzbMATH Open1259.90084OpenAlexW2050342819MaRDI QIDQ694182FDOQ694182
Authors: Michel Minoux 
Publication date: 11 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0341-z
Recommendations
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Robust solutions of uncertain linear programs
- Two-stage robust optimization, state-space representable uncertainty and applications
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
robust optimizationellipsoidal uncertaintyrobust linear programmingcomplexity of robust linear programmingpolyhedral uncertainty
Stochastic programming (90C15) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Robust optimization
- A descent algorithm for nonsmooth convex optimization
- The Price of Robustness
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Second-order cone programming
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust optimization-methodology and applications
- Robust convex optimization
- Title not available (Why is that?)
- Quadratic programming with one negative eigenvalue is NP-hard
- Robust Combinatorial Optimization with Exponential Scenarios
- Adjustable robust solutions of uncertain linear programs
- Hardness of robust network design
- Inexact linear programming with generalized resource sets
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Optimality of affine policies in multistage robust optimization
- On nonconvex quadratic programming with box constraints
- Title not available (Why is that?)
- Finite Adaptability in Multistage Linear Optimization
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Checking local optimality in constrained quadratic programming is NP- hard
- Solving some multistage robust decision problems with huge implicitly defined scenario trees
- On robust maximum flow with polyhedral uncertainty sets
- Models and algorithms for robust PERT scheduling with time-dependent tast durations
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- An introduction to the theory of nonsmooth optimization
Cited In (4)
- Two-stage robust optimization, state-space representable uncertainty and applications
- A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- A new sequential lifting of robust cover inequalities
This page was built for publication: Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694182)
