Pages that link to "Item:Q1374385"
From MaRDI portal
The following pages link to Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385):
Displaying 17 items.
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- Degeneracy resolution for bilinear utility functions (Q650206) (← links)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- Making progress during a stall in the simplex algorithm (Q1116654) (← links)
- Degeneracy graphs and simplex cycling (Q1189552) (← links)
- Resolving degeneracy in quadratic programming (Q1312769) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- The simplex algorithm with a new primal and dual pivot rule (Q1342283) (← links)
- Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent (Q1804357) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- A least-squares primal-dual algorithm for solving linear programming problems (Q1866990) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- A combinatorial program using the simplex method. (Q2772320) (← links)
- An improved primal simplex algorithm for degenerate linear programs (Q2899148) (← links)
- (Q3321827) (← links)