The following pages link to An analysis of degeneracy (Q3787787):
Displaying 16 items.
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- Approaches to sensitivity analysis in linear programming (Q757255) (← links)
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
- Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
- Weakly redundant constraints and their impact on postoptimal analyses in LP (Q1199513) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Encounters with degeneracy: A personal view (Q1312770) (← links)
- On some properties of \(0\)-degeneracy graphs (Q1312774) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Limit laws for empirical optimal solutions in random linear programs (Q2159558) (← links)