A simplex method for uncapacitated pure-supply infinite network flow problems

DOI10.1137/17M1137553MaRDI QIDQ3174805zbMATH OpenOpenAlexWikidataFDO

Authors Christopher Thomas Ryan, Robert L. Smith, Marina Epelman

Publication date 18 July 2018

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

Full work available at URL https://doi.org/10.1137/17m1137553

zbMATH Keywords

dualityinfinite networksnetwork simplex method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Infinite graphs (05C63) Extreme-point and pivoting methods (90C49)

Recommendations

• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Extreme point characterizations for infinite network flow problems
• A shadow simplex method for infinite linear programs
• A simplex method for countably infinite linear programs
• A continuous-time network simplex algorithm

Cites work

• scientific article; zbMATH DE number 5776838 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 1983335 (Why is no real title available?)
• A Duality Theory for Separated Continuous Linear Programs
• A linear programming approach to nonstationary infinite-horizon Markov decision processes
• A network simplex method
• A shadow simplex method for infinite linear programs
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Characterizing extreme points as basic feasible solutions in infinite linear programs
• Circumventing the Slater conundrum in countably infinite linear programs
• Duality in Countably Infinite Monotropic Programs
• Duality in infinite dimensional linear programming
• Dynamic version of the economic lot size model
• Extreme point characterizations for infinite network flow problems
• Finite dimensional approximation in infinite dimensional mathematical programming
• Infinite dimensional analysis. A hitchhiker's guide.
• Network flows. Theory, algorithms, and applications.
• On packing and covering polyhedra in infinite dimensions
• On the use of purely finitely additive multipliers in mathematical programming
• Shadow prices in infinite-dimensional linear programming
• Simplex algorithm for countable-state discounted Markov decision processes
• The Max-Flow Min-Cut theorem for countable networks

Cited in

(10)

• A greedy algorithm for finding maximum spanning trees in infinite graphs
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
• Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
• A shadow simplex method for infinite linear programs
• Uncapacitated flow-based extended formulations
• Minimum spanning trees in infinite graphs: theory and algorithms
• Extreme point characterizations for infinite network flow problems
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
• A simplex method for countably infinite linear programs

This page was built for publication: A simplex method for uncapacitated pure-supply infinite network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174805)