Parametric linear programming and anti-cycling pivoting rules
From MaRDI portal
Publication:1108192
DOI10.1007/BF01580770zbMATH Open0653.90040OpenAlexW2081964341WikidataQ59592710 ScholiaQ59592710MaRDI QIDQ1108192FDOQ1108192
Authors: Thomas L. Magnanti, James B. Orlin 
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580770
Recommendations
- A practical anti-cycling procedure for linearly constrained optimization
- Systematic construction of examples for cycling in the simplex method
- scientific article; zbMATH DE number 3904322
- A new revised simplex method for degenerate linear programs
- Making progress during a stall in the simplex algorithm
Cites Work
- New Finite Pivoting Rules for the Simplex Method
- Title not available (Why is that?)
- Optimality and Degeneracy in Linear Programming
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
- The Average number of pivot steps required by the Simplex-Method is polynomial
- A Technique for Resolving Degeneracy in Linear Programming
- Linear quadratic programming in oriented matroids
- On the average number of steps of the simplex method of linear programming
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
Cited In (17)
- A constrained nonlinear 0-1 program for data allocation
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- Systematic construction of examples for cycling in the simplex method
- A practical anti-degeneracy row selection technique in network linear programming
- A combinatorial program using the simplex method.
- Degeneracy graphs: Theory and applications. An updated survey
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Encounters with degeneracy: A personal view
- Pivot rules for linear programming: A survey on recent theoretical developments
- Applications of the parametric programming procedure
- A practical anti-cycling procedure for linearly constrained optimization
- Title not available (Why is that?)
- Selected bibliography on degeneracy
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- Cycling in linear programming problems
- Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
- Geometry of the Gass-Saaty parametric cost LP algorithm
This page was built for publication: Parametric linear programming and anti-cycling pivoting rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108192)
