A Technique for Resolving Degeneracy in Linear Programming

Cited in

(37)

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

This page was built for publication: A Technique for Resolving Degeneracy in Linear Programming

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