Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix

DOI10.1142/9789812813220_0002MaRDI QIDQ3542358zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen, Santosh N. Kabadi

Publication date 1 December 2008

Published in Mathematical Programming and Game Theory for Decision Making (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812813220_0002

zbMATH Keywords

linear programmingsimplex methodanti-cycling pivot selection ruletotally unimodular coefficient matrix

Mathematics Subject Classification ID

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

Recommendations

• Parametric linear programming and anti-cycling pivoting rules
• Anti-stalling pivot rules for the network simplex algorithm
• Pivot rules for linear programming: A survey on recent theoretical developments
• On anti-cycling pivoting rules for the simplex method
• A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
• A pivoting algorithm for linear programming with linear complementarity constraints
• Practical finite pivoting rules for the simplex method
• Stabilization method for a lexicographic linear programming problem
• An affine-scaling pivot algorithm for linear programming
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming

Cited in

(5)

• On the number of degenerate simplex pivots
• A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
• On the number of degenerate simplex pivots
• A strongly polynomial simplex method for the linear fractional assignment problem
• Anti-stalling pivot rules for the network simplex algorithm

This page was built for publication: Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix

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