The following pages link to (Q4888222):
Displaying 9 items.
- 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)
- 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 projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
- A modified non-simplex active-set method for the standard LP problem (Q2915374) (← links)
- A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523) (← links)
- (Q4300103) (← links)