A new version of the improved primal simplex for degenerate linear programs

DOI10.1016/J.COR.2009.03.020MaRDI QIDQ733525zbMATH OpenOpenAlexFDO

Authors Vincent Raymond, François Soumis, D. Orban

Publication date 16 October 2009

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

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

zbMATH Keywords

linear programmingdegeneracyprimal simplex

Mathematics Subject Classification ID

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

Recommendations

• A linear programming decomposition focusing on the span of the nondegenerate columns
• An improved primal simplex algorithm for degenerate linear programs
• A new revised simplex method for degenerate linear programs
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• A primal deficient-basis simplex algorithm for linear programming

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A Technique for Resolving Degeneracy in Linear Programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
• An improved primal simplex algorithm for degenerate linear programs
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• New Finite Pivoting Rules for the Simplex Method
• On the solution of highly degenerate linear programmes
• Optimality and Degeneracy in Linear Programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems

Cited in

(12)

• Row-reduced column generation for degenerate master problems
• Integral simplex using decomposition for the set partitioning problem
• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• Stabilized dynamic constraint aggregation for solving set partitioning problems
• Customizing the solution process of COIN-OR's linear solvers with python
• The double pivot simplex method
• Column generation decomposition with the degenerate constraints in the subproblem
• scientific article; zbMATH DE number 6938247 (Why is no real title available?)
• A linear programming decomposition focusing on the span of the nondegenerate columns
• An improved primal simplex algorithm for degenerate linear programs
• About the minimum mean cycle-canceling algorithm
• The positive edge criterion within COIN-OR's CLP

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A new version of the improved primal simplex for degenerate linear programs

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