Circumventing the Slater conundrum in countably infinite linear programs
From MaRDI portal
Publication:319852
Recommendations
- Duality in Countably Infinite Monotropic Programs
- Duality in infinite dimensional linear programming
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- A simplex method for countably infinite linear programs
- Duality in Markov Decision Problems with Countable Action and State Spaces
Cites work
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 3906232 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 4067581 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3484308 (Why is no real title available?)
- scientific article; zbMATH DE number 1348599 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1786124 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- A shadow simplex method for infinite linear programs
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage
- Convex infinite horizon programs
- Denumerable Constrained Markov Decision Processes and Finite Approximations
- Duality in Markov Decision Problems with Countable Action and State Spaces
- Duality in infinite dimensional linear programming
- Duality overlap in infinite linear programs
- Dynamic lot-sizing in sequential online retail auctions
- Extreme point characterizations for infinite network flow problems
- Finite horizon approximations of infinite horizon linear programs
- Infinite Horizon Optimization
- Infinite Horizon Programs
- Infinite dimensional analysis. A hitchhiker's guide
- Linear programming formulation of MDPs in countable state space: The multichain case
- On the sufficiency of finite support duals in semi-infinite linear programming
- On the use of purely finitely additive multipliers in mathematical programming
- Robust optimization
- Shadow prices in infinite-dimensional linear programming
- Stationary dual prices and depreciation
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
Cited in
(10)- Robust optimization in countably infinite linear programs
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- Duality in Countably Infinite Monotropic Programs
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Inverse optimization in semi-infinite linear programs
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
- A simplex method for countably infinite linear programs
- A simplex method for uncapacitated pure-supply infinite network flow problems
This page was built for publication: Circumventing the Slater conundrum in countably infinite linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319852)
