The following pages link to (Q4879697):
Displaying 6 items.
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← 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)
- A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)