Robust optimization in countably infinite linear programs
From MaRDI portal
Publication:276340
DOI10.1007/s11590-015-0958-4zbMath1367.90119OpenAlexW2254712474MaRDI QIDQ276340
Publication date: 3 May 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0958-4
Related Items (3)
Convexity and closedness in stable robust duality ⋮ Robust continuous linear programs ⋮ A dual scheme for solving linear countable semi-infinite fractional programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circumventing the Slater conundrum in countably infinite linear programs
- Duality in infinite dimensional linear programming
- Finite dimensional approximation in infinite dimensional mathematical programming
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Infinite dimensional analysis. A hitchhiker's guide
- Shadow Prices in Infinite-Dimensional Linear Programming
- Robust Convex Optimization
- A Shadow Simplex Method for Infinite Linear Programs
- Theory and Applications of Robust Optimization
- Extreme point characterizations for infinite network flow problems
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- The Price of Robustness
- Infinite Horizon Stochastic Programs
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Simplex Algorithm for Countable-State Discounted Markov Decision Processes
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust Dynamic Programming
This page was built for publication: Robust optimization in countably infinite linear programs
