Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis

DOI10.1287/ijoc.2015.0656zbMath1338.90246OpenAlexW2195470006MaRDI QIDQ2802253

Vincent Raymond, François Soumis, Samuel Rosat, Jérémy Omer

Publication date: 25 April 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2015.0656

zbMATH Keywords

linear programmingdecompositiondegeneracysimplexprimal algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ The positive edge pricing rule for the dual simplex ⋮ Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling ⋮ Influence of the normalization constraint on the integral simplex using decomposition

Uses Software

• DEVEX

Cites Work

• The positive edge criterion within COIN-OR's CLP
• A new version of the improved primal simplex for degenerate linear programs
• Column generation decomposition with the degenerate constraints in the subproblem
• A practical anti-cycling procedure for linearly constrained optimization
• Integral simplex using decomposition with primal cutting planes
• A primal deficient-basis simplex algorithm for linear programming
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• A degeneracy exploiting LU factorization for the simplex method
• A practicable steepest-edge simplex algorithm
• A class of methods for linear programming
• Large-scale linearly constrained optimization
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Pivot selection methods of the Devex LP code
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks

This page was built for publication: Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis