On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
type: Item
instance of: scholarly article
title: On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
zbMATH Open document ID: 1410.90238
author: Pranjal Awasthi
author: Vineet Goyal
author: Brian Y. Lu
published in: Mathematical Programming. Series A. Series B
publication date: 2019-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7014735
zbMATH Keywords: robust optimization
zbMATH Keywords: approximation algorithms
zbMATH Keywords: hardness of approximation
MaRDI profile type: Publication
full work available at URL: s10107-017-1222-8
OpenAlex ID: W2781766067
cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations
cites work: Q3182207
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Robust optimization-methodology and applications
cites work: Theory and Applications of Robust Optimization
cites work: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
cites work: On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
cites work: On the power and limitations of affine policies in two-stage adaptive optimization
cites work: On the approximability of adjustable robust convex optimization under uncertainty
cites work: A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
cites work: A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Adaptivity and approximation for stochastic packing problems
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: A threshold of ln n for approximating set cover
cites work: Robust Combinatorial Optimization with Exponential Scenarios
cites work: Robust Portfolio Selection Problems
cites work: A PTAS for the chance-constrained knapsack problem with random item sizes
cites work: Q4309474
cites work: Q3126752
cites work: Stochastic programming approach to optimization under uncertainty
cites work: Lectures on Stochastic Programming
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Robust resource allocations in temporal networks
DOI: 10.1007/S10107-017-1222-8
description: scientific article; zbMATH DE number 7014735