On the solution of highly degenerate linear programmes
From MaRDI portal
Publication:1106719
DOI10.1007/BF01580776zbMath0651.90045OpenAlexW2088128439MaRDI QIDQ1106719
Michael R. Osborne, David M. Ryan
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/bf01580776
Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Related Items
On the integer properties of scheduling set partitioning models, Finding normal solutions in piecewise linear programming, A dual strategy for solving the linear programming relaxation of a driver scheduling system, The positive edge criterion within COIN-OR's CLP, Discontinuous piecewise linear optimization, Revisiting degeneracy, strict feasibility, stability, in linear programming, Multi-phase dynamic constraint aggregation for set partitioning type problems, A new version of the improved primal simplex for degenerate linear programs, A practical anti-cycling procedure for linearly constrained optimization, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Pivot rules for linear programming: A survey on recent theoretical developments, Bounds on the number of vertices of perturbed polyhedra, Resolving degeneracy in quadratic programming, Encounters with degeneracy: A personal view, On degeneracy in linear programming and related problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- A degeneracy exploiting LU factorization for the simplex method
- New Finite Pivoting Rules for the Simplex Method
- Theoretical Properties of the Network Simplex Method
- A Technique for Resolving Degeneracy in Linear Programming
- Optimality and Degeneracy in Linear Programming
