Pages that link to "Item:Q715068"
From MaRDI portal
The following pages link to On the power and limitations of affine policies in two-stage adaptive optimization (Q715068):
Displaying 50 items.
- Generalized decision rule approximations for stochastic programming via liftings (Q494331) (← links)
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← links)
- Distribution-dependent robust linear optimization with applications to inventory control (Q499320) (← links)
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective (Q747776) (← links)
- Piecewise static policies for two-stage adjustable robust linear optimization (Q1646580) (← links)
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? (Q1659683) (← links)
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints (Q1717231) (← links)
- Conditions under which adjustability lowers the cost of a robust linear program (Q1730447) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope (Q1789596) (← links)
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches (Q1789611) (← links)
- Robust optimization of uncertain multistage inventory systems with inexact data in decision rules (Q1789612) (← links)
- Prescriptive analytics for human resource planning in the professional services industry (Q1991173) (← links)
- The decision rule approach to optimization under uncertainty: methodology and applications (Q2010368) (← links)
- Oracle-based algorithms for binary two-stage robust optimization (Q2023665) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization (Q2191764) (← links)
- Robust post-disaster route restoration (Q2215565) (← links)
- Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
- Robust optimal control with adjustable uncertainty sets (Q2374497) (← links)
- Robust recycling facility location with clustering (Q2669561) (← links)
- Expansion planning for waste-to-energy systems using waste forecast prediction sets (Q2808492) (← links)
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions (Q2830769) (← links)
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds (Q2830953) (← links)
- Adjustable Robust Optimization via Fourier–Motzkin Elimination (Q4971396) (← links)
- Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity (Q4971569) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets (Q5000650) (← links)
- Technical Note—Two-Stage Sample Robust Optimization (Q5031032) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
- Robust Capacity Planning for Project Management (Q5084614) (← links)
- Designing Response Supply Chain Against Bioattacks (Q5129192) (← links)
- A Primal–Dual Lifting Scheme for Two-Stage Robust Optimization (Q5131477) (← links)
- Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection (Q5131707) (← links)
- Affine recourse for the robust network design problem: Between static and dynamic routing (Q5326787) (← links)
- Decision rule-based method in solving adjustable robust capacity expansion problem (Q6040855) (← links)
- Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management (Q6053589) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- Affine routing for robust network design (Q6065910) (← links)
- Robust homecare service capacity planning (Q6109551) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens (Q6126657) (← links)
- Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides (Q6145049) (← links)
- Robust convex optimization: a new perspective that unifies and extends (Q6160285) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
