The positive edge criterion within COIN-OR's CLP

DOI10.1016/j.cor.2014.03.020zbMath1349.90612OpenAlexW2022113358MaRDI QIDQ342010

Jacques Desrosiers, François Soumis, Mehdi Towhidi

Publication date: 17 November 2016

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

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

zbMATH Keywords

linear programmingdegeneracypositive edgeprimal simplex

Mathematics Subject Classification ID

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

Related Items (5)

A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ The positive edge pricing rule for the dual simplex ⋮ Integral simplex using decomposition with primal cutting planes ⋮ Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs

Uses Software

• CPLEX
• KORBX
• COIN-OR
• CLP
• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large-scale linear programs by aggregation
• A new version of the improved primal simplex for degenerate linear programs
• On the choice of explicit stabilizing terms in column generation
• On the solution of highly degenerate linear programmes
• Stabilized column generation
• Steepest-edge simplex algorithms for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• A practicable steepest-edge simplex algorithm
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming

This page was built for publication: The positive edge criterion within COIN-OR's CLP