On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints

DOI10.1007/s10107-017-1222-8zbMath1410.90238OpenAlexW2781766067MaRDI QIDQ1717231

Pranjal Awasthi, Brian Y. Lu, Vineet Goyal

Publication date: 7 February 2019

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1222-8

zbMATH Keywords

robust optimizationapproximation algorithmshardness of approximation

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Conditions under which adjustability lowers the cost of a robust linear program

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power and limitations of affine policies in two-stage adaptive optimization
• Robust resource allocations in temporal networks
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Stochastic programming approach to optimization under uncertainty
• Robust solutions of uncertain linear programs
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• Robust discrete optimization and network flows
• Robust optimization-methodology and applications
• A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
• On the approximability of adjustable robust convex optimization under uncertainty
• Robust Convex Optimization
• Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
• Theory and Applications of Robust Optimization
• A threshold of ln n for approximating set cover
• On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
• A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization
• The Price of Robustness
• Lectures on Stochastic Programming
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Robust Combinatorial Optimization with Exponential Scenarios
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robust Portfolio Selection Problems

This page was built for publication: On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints