Circumventing the Slater conundrum in countably infinite linear programs
Provides duality results for general countably infinite linear programs. Proves properties of the Lagrangian function and saddle points. Applies results to countable-state MDPs and to a robust auction-design problem.
infinite-dimensional linear optimization markov decision processes shadow prices