Pages that link to "Item:Q3098281"
From MaRDI portal
The following pages link to A Shadow Simplex Method for Infinite Linear Programs (Q3098281):
Displaying 14 items.
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
- Policy iteration for robust nonstationary Markov decision processes (Q518127) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Inverse optimization in countably infinite linear programs (Q1785341) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- Shadow prices in infinite-dimensional linear programming (Q2757532) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes (Q6116235) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)