Circumventing the Slater conundrum in countably infinite linear programs
type: Item
instance of: scholarly article
title: Circumventing the Slater conundrum in countably infinite linear programs
zbMATH Open document ID: 1346.90573
author: Archis Ghate
published in: European Journal of Operational Research
publication date: 2016-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6633700
zbMATH Keywords: infinite-dimensional linear optimization
zbMATH Keywords: Markov decision processes
zbMATH Keywords: shadow prices
MaRDI profile type: Publication
full work available at URL: j.ejor.2015.04.026
OpenAlex ID: W2037249457
cites work: Infinite dimensional analysis. A hitchhiker's guide
cites work: Denumerable Constrained Markov Decision Processes and Finite Approximations
cites work: Q4264741
cites work: Q3770273
cites work: Q4067292
cites work: On the sufficiency of finite support duals in semi-infinite linear programming
cites work: Q3182207
cites work: Dynamic lot-sizing in sequential online retail auctions
cites work: Q3844775
cites work: Duality in Markov Decision Problems with Countable Action and State Spaces
cites work: Q5721624
cites work: A Shadow Simplex Method for Infinite Linear Programs
cites work: A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
cites work: Infinite Horizon Programs
cites work: Finite horizon approximations of infinite horizon linear programs
cites work: Convex infinite horizon programs
cites work: Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage
cites work: Duality overlap in infinite linear programs
cites work: Q4547444
cites work: Linear programming formulation of MDPs in countable state space: The multichain case
cites work: Stationary dual prices and depreciation
cites work: Q5566063
cites work: The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
cites work: Q3671749
cites work: On the use of purely finitely additive multipliers in mathematical programming
cites work: Q4315289
cites work: Extreme point characterizations for infinite network flow problems
cites work: Shadow prices in infinite-dimensional linear programming
cites work: Duality in infinite dimensional linear programming
cites work: Q3683893
cites work: Infinite Horizon Optimization
cites work: A simplex algorithm for minimum-cost network-flow problems in infinite networks
cites work: Q3800532
DOI: 10.1016/J.EJOR.2015.04.026
description: scientific article; zbMATH DE number 6633700