Pages that link to "Item:Q751498"
From MaRDI portal
The following pages link to Practical finite pivoting rules for the simplex method (Q751498):
Displayed 18 items.
- A note on ``An improved initial basis for the simplex algorithm'' (Q883303) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A note on two direct methods in linear programming (Q1827666) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
- A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523) (← links)
- A Variant of the Dual Pivoting Rule in Linear Programming (Q4321114) (← links)