The positive edge pricing rule for the dual simplex

DOI10.1016/J.COR.2015.03.009MaRDI QIDQ337606zbMATH OpenOpenAlexFDO

Authors Jérémy Omer, Mehdi Towhidi, 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)

Recommendations

• The positive edge criterion within COIN-OR's CLP
• Two partial pricing strategies for the simplex algorithm
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• A dual approach to primal degeneracy
• A new revised simplex method for degenerate linear programs

Cites work

• scientific article; zbMATH DE number 3209723 (Why is no real title available?)
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A dual approach to primal degeneracy
• A generalized dual phase-2 simplex algorithm.
• A linear programming decomposition focusing on the span of the nondegenerate columns
• A practical anti-cycling procedure for linearly constrained optimization
• An improved primal simplex algorithm for degenerate linear programs
• Benchmarking optimization software with performance profiles.
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• Solving Real-World Linear Programs: A Decade and More of Progress
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Steepest-edge simplex algorithms for linear programming
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The positive edge criterion within COIN-OR's CLP

Describes a project that uses

Uses Software

• COIN-OR

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

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