The positive edge pricing rule for the dual simplex

DOI10.1016/j.cor.2015.03.009zbMath1348.90461OpenAlexW1975381074MaRDI QIDQ337606

Mehdi Towhidi, Jérémy Omer, François Soumis

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.03.009

zbMATH Keywords

linear programmingdegeneracydual simplexpositive edgepricing criterion

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Uses Software

• COIN-OR

Cites Work

• Unnamed Item
• A linear programming decomposition focusing on the span of the nondegenerate columns
• The positive edge criterion within COIN-OR's CLP
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• A dual approach to primal degeneracy
• A practical anti-cycling procedure for linearly constrained optimization
• Steepest-edge simplex algorithms for linear programming
• A generalized dual phase-2 simplex algorithm.
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• Solving Real-World Linear Programs: A Decade and More of Progress
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Benchmarking optimization software with performance profiles.

This page was built for publication: The positive edge pricing rule for the dual simplex