Pages that link to "Item:Q5334752"
From MaRDI portal
The following pages link to A Technique for Resolving Degeneracy in Linear Programming (Q5334752):
Displayed 30 items.
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- Approaches to sensitivity analysis in linear programming (Q757255) (← links)
- The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix (Q1054437) (← links)
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey (Q1075251) (← links)
- Strict Chebyshev approximation for general systems of linear equations (Q1095588) (← links)
- On the integer properties of scheduling set partitioning models (Q1100095) (← links)
- Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- Degeneracy in the presence of roundoff errors (Q1105984) (← links)
- On the solution of highly degenerate linear programmes (Q1106719) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Making progress during a stall in the simplex algorithm (Q1116654) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- Resolving degeneracy in quadratic programming (Q1312769) (← links)
- Encounters with degeneracy: A personal view (Q1312770) (← links)
- On degeneracy in linear programming and related problems (Q1312772) (← links)
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties (Q1813345) (← links)
- Some NP-complete problems in linear programming (Q1837108) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)