A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems

DOI10.1137/17M1137553zbMath1402.90199OpenAlexW2883274460WikidataQ129519664 ScholiaQ129519664MaRDI QIDQ3174805

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

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) Extreme-point and pivoting methods (90C49) Infinite graphs (05C63)

Related Items (5)

Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes ⋮ Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs ⋮ Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces ⋮ A greedy algorithm for finding maximum spanning trees in infinite graphs ⋮ A Simplex Method for Countably Infinite Linear Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circumventing the Slater conundrum in countably infinite linear programs
• The Max-Flow Min-Cut theorem for countable networks
• Characterizing extreme points as basic feasible solutions in infinite linear programs
• On the use of purely finitely additive multipliers in mathematical programming
• Duality in infinite dimensional linear programming
• Finite dimensional approximation in infinite dimensional mathematical programming
• On packing and covering polyhedra in infinite dimensions
• Shadow Prices in Infinite-Dimensional Linear Programming
• Dynamic Version of the Economic Lot Size Model
• A Shadow Simplex Method for Infinite Linear Programs
• Extreme point characterizations for infinite network flow problems
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• A network simplex method
• A Duality Theory for Separated Continuous Linear Programs
• A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
• Duality in Countably Infinite Monotropic Programs
• Simplex Algorithm for Countable-State Discounted Markov Decision Processes

This page was built for publication: A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems