Pages that link to "Item:Q1659683"
From MaRDI portal
The following pages link to When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? (Q1659683):
Displayed 10 items.
- Conditions under which adjustability lowers the cost of a robust linear program (Q1730447) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Strategic facility location, capacity acquisition, and technology choice decisions under demand uncertainty: robust vs. non-robust optimization approaches (Q1753532) (← links)
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules (Q1996732) (← links)
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
- Robust flows with adaptive mitigation (Q6114899) (← links)
- Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens (Q6126657) (← links)