Circumventing the Slater conundrum in countably infinite linear programs

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Duality in infinite dimensional linear programming
Infinite dimensional analysis. A hitchhiker's guide
Shadow prices in infinite-dimensional linear programming
A Shadow Simplex Method for Infinite Linear Programs
Extreme point characterizations for infinite network flow problems
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
A simplex algorithm for minimum-cost network-flow problems in infinite networks
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Stationary dual prices and depreciation
On the use of purely finitely additive multipliers in mathematical programming
On the sufficiency of finite support duals in semi-infinite linear programming
Duality overlap in infinite linear programs
Infinite Horizon Optimization
Convex infinite horizon programs
Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage
Finite horizon approximations of infinite horizon linear programs
Dynamic lot-sizing in sequential online retail auctions
Denumerable Constrained Markov Decision Processes and Finite Approximations
Linear programming formulation of MDPs in countable state space: The multichain case
Duality in Markov Decision Problems with Countable Action and State Spaces
Infinite Horizon Programs
Title not available (Why is that?)

Cited In (10)

A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
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
Robust optimization in countably infinite linear programs
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
Duality in Countably Infinite Monotropic Programs
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
Inverse optimization in semi-infinite linear programs
A Simplex Method for Countably Infinite Linear Programs
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization

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)