A Technique for Resolving Degeneracy in Linear Programming

DOI10.1137/0111016zbMath0127.36903OpenAlexW2053732480MaRDI QIDQ5334752

Philip Wolfe

Publication date: 1963

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0111016

zbMATH Keywords

operations research

Related Items

A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming, Strict Chebyshev approximation for general systems of linear equations, On the integer properties of scheduling set partitioning models, Survey of solved and open problems in the degeneracy phenomenon, A dual approach to primal degeneracy, Finding normal solutions in piecewise linear programming, Degeneracy in the presence of roundoff errors, On the solution of highly degenerate linear programmes, A dual strategy for solving the linear programming relaxation of a driver scheduling system, Parametric linear programming and anti-cycling pivoting rules, Making progress during a stall in the simplex algorithm, Discontinuous piecewise linear optimization, A linear programming primer: from Fourier to Karmarkar, Analytical aspects of tie breaking, Primal-dual active-set methods for large-scale optimization, Multi-phase dynamic constraint aggregation for set partitioning type problems, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, A new version of the improved primal simplex for degenerate linear programs, Another look at linear programming for feature selection via methods of regularization, A practical anti-cycling procedure for linearly constrained optimization, Practical finite pivoting rules for the simplex method, A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties, Least-index resolution of degeneracy in quadratic programming, Approaches to sensitivity analysis in linear programming, Some NP-complete problems in linear programming, The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix, Bi-objective multistage stochastic linear programming, Pivot versus interior point methods: Pros and cons, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, 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, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, A practical anti-degeneracy row selection technique in network linear programming, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey