An improved primal simplex algorithm for degenerate linear programs

DOI10.1287/IJOC.1100.0425MaRDI QIDQ2899148zbMATH OpenOpenAlexFDO

Authors Abdelmoutalib Metrane, Guy Desaulniers, François Soumis, Issmail Elhallaoui

Publication date 28 July 2012

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

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

zbMATH Keywords

linear programmingdegeneracyprimal simplex algorithm

Mathematics Subject Classification ID

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

Recommendations

• A new version of the improved primal simplex for degenerate linear programs
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm
• A new revised simplex method for degenerate linear programs
• scientific article; zbMATH DE number 1546510
• Dual-primal algorithm for linear optimization

Cited in

(29)

• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• The double pivot simplex method
• Linear fractional approximations for master problems in column generation
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• scientific article; zbMATH DE number 6938247 (Why is no real title available?)
• Integral simplex using decomposition for the set partitioning problem
• Improved integral simplex using decomposition for the set partitioning problem
• Integral Column Generation for Set Partitioning Problems with Side Constraints
• Influence of the normalization constraint on the integral simplex using decomposition
• Dynamic constraint and variable aggregation in column generation
• Vector Space Decomposition for Solving Large-Scale Linear Programs
• scientific article; zbMATH DE number 1546510 (Why is no real title available?)
• A linear programming decomposition focusing on the span of the nondegenerate columns
• Improving set partitioning problem solutions by zooming around an improving direction
• The positive edge criterion within COIN-OR's CLP
• Improving a primal–dual simplex-type algorithm using interior point methods
• The minimum mean cycle-canceling algorithm for linear programs
• A new version of the improved primal simplex for degenerate linear programs
• The positive edge pricing rule for the dual simplex
• Integral simplex using decomposition with primal cutting planes
• Column generation decomposition with the degenerate constraints in the subproblem
• Distributed integral column generation for set partitioning problems
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• About the minimum mean cycle-canceling algorithm
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
• A column generation approach for solving the patient admission scheduling problem
• A new pivoting rule for solving various degeneracy problems

This page was built for publication: An improved primal simplex algorithm for degenerate linear programs

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