A Simplex Method for Countably Infinite Linear Programs

DOI10.1137/19M1303939zbMath1483.90178OpenAlexW4205808827MaRDI QIDQ5020851

Christopher Thomas Ryan, Robert L. Smith, Archis Ghate

Publication date: 7 January 2022

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1303939

zbMATH Keywords

simplex methodinfinite-dimensional optimizationcountably infinite linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Extreme-point and pivoting methods (90C49)

Related Items (1)

Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circumventing the Slater conundrum in countably infinite linear programs
• Convergence of selections with applications in optimization
• Characterizing extreme points as basic feasible solutions in infinite linear programs
• Finite dimensional approximation in infinite dimensional mathematical programming
• Strong duality for generalized monotropic programming in infinite dimensions
• Online searching with turn cost
• Non-Stationary Stochastic Optimization
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
• Decomposable Markov Decision Processes: A Fluid Optimization Approach
• A Shadow Simplex Method for Infinite Linear Programs
• A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
• Dynamic Bid Prices in Revenue Management
• Extreme point characterizations for infinite network flow problems
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Infinite Horizon Stochastic Programs
• Infinite Linear Programming in Games with Partial Information
• From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
• On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
• Duality for Optimization Problems with Infinite Sums
• A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
• Duality in Countably Infinite Monotropic Programs
• Simplex Algorithm for Countable-State Discounted Markov Decision Processes
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• Duality and Existence of Optimal Policies in Generalized Joint Replenishment
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces

This page was built for publication: A Simplex Method for Countably Infinite Linear Programs