On 2-stage robust LP with RHS uncertainty: complexity results and applications
From MaRDI portal
Publication:628752
DOI10.1007/s10898-010-9645-2zbMath1213.90172OpenAlexW2080573456MaRDI QIDQ628752
Publication date: 14 March 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9645-2
robust network optimizationrobust production planningcomplexity of robust linear programmingrobust inventory managementrobust PERT scheduling
Related Items
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times, On robust maximum flow with polyhedral uncertainty sets, Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty, Robust optimization for non-linear impact of data variation, Robust Shift Scheduling in Call Centers, \(\Gamma\)-robust optimization of project scheduling problems, Robust inventory control under demand and lead time uncertainty, 2-stage robust MILP with continuous recourse variables, Robust combinatorial optimization under convex and discrete cost uncertainty, A robust basic cyclic scheduling problem, A utility theory based interactive approach to robustness in linear optimization, Robust multicovers with budgeted uncertainty, Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard, Recent advances in robust optimization: an overview, Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard, Oracle-based algorithms for binary two-stage robust optimization, Adjustable Robust Optimization via Fourier–Motzkin Elimination, Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Routing of uncertain traffic demands
- On robust maximum flow with polyhedral uncertainty sets
- Models and algorithms for robust PERT scheduling with time-dependent tast durations
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Partitioning procedures for solving mixed-variables programming problems
- The ellipsoid method and its consequences in combinatorial optimization
- Inexact linear programming with generalized resource sets
- A robustness approach to uncapacitated network design problems
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust optimization-methodology and applications
- Robust Convex Optimization
- Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- An approach to robust network design in telecommunications
- Hardness of robust network design
- The Price of Robustness
- Robust Optimization for Power Systems Capacity Expansion under Uncertainty
- Robust capacity expansion of network flows
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
