A shadow simplex method for infinite linear programs
From MaRDI portal
Publication:3098281
Recommendations
- A simplex method for countably infinite linear programs
- scientific article; zbMATH DE number 3889273
- A simplex method for uncapacitated pure-supply infinite network flow problems
- Simplex algorithm for countable-state discounted Markov decision processes
- An extension of the simplex algorithm for semi-infinite linear programming
Cited in
(17)- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- Robust optimization in countably infinite linear programs
- Circumventing the Slater conundrum in countably infinite linear programs
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Duality in Countably Infinite Monotropic Programs
- scientific article; zbMATH DE number 4135710 (Why is no real title available?)
- Simplex algorithm for countable-state discounted Markov decision processes
- Shadow prices in infinite-dimensional linear programming
- A simplex method for uncapacitated pure-supply infinite network flow problems
- Recent contributions to linear semi-infinite optimization
- scientific article; zbMATH DE number 3889273 (Why is no real title available?)
- Inverse optimization in countably infinite linear programs
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
- A simplex method for countably infinite linear programs
- Policy iteration for robust nonstationary Markov decision processes
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: A shadow simplex method for infinite linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098281)
