An improved primal simplex algorithm for degenerate linear programs

DOI10.1287/IJOC.1100.0425zbMATH Open1243.90121OpenAlexW2097828930MaRDI QIDQ2899148FDOQ2899148

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

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

zbMATH Keywords

linear programmingdegeneracyprimal simplex algorithm

Mathematics Subject Classification ID

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

Cited In (29)

• Improved primal simplex: a more general theoretical framework and an extended experimental analysis
• Linear fractional approximations for master problems in column generation
• The double pivot simplex method
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Improving set partitioning problem solutions by zooming around an improving direction
• A linear programming decomposition focusing on the span of the nondegenerate columns
• Improving a primal–dual simplex-type algorithm using interior point methods
• The positive edge criterion within COIN-OR's CLP
• The minimum mean cycle-canceling algorithm for linear programs
• A new version of the improved primal simplex for degenerate linear programs
• Integral simplex using decomposition with primal cutting planes
• The positive edge pricing rule for the dual simplex
• 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
• A column generation approach for solving the patient admission scheduling problem
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
• 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)