Shadow Prices in Infinite-Dimensional Linear Programming
From MaRDI portal
Publication:2757532
DOI10.1287/moor.23.1.239zbMath0977.90024OpenAlexW2066957127MaRDI QIDQ2757532
H. Edwin Romeijn, Robert L. Smith
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/7311
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Semi-infinite programming (90C34)
Related Items (11)
Robust optimization in countably infinite linear programs ⋮ A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems ⋮ Circumventing the Slater conundrum in countably infinite linear programs ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ Inverse optimization in semi-infinite linear programs ⋮ Matching variables to equations in infinite linear equation systems ⋮ Duality in Countably Infinite Monotropic Programs ⋮ The value function of an infinite-horizon single-item lot-sizing problem ⋮ Inverse optimization in countably infinite linear programs ⋮ On packing and covering polyhedra in infinite dimensions ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks
This page was built for publication: Shadow Prices in Infinite-Dimensional Linear Programming
