Pages that link to "Item:Q1278948"
From MaRDI portal
The following pages link to The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948):
Displaying 15 items.
- On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
- 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)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Book review of: P.-Q. Pan, Linear programming computation (Q1754296) (← 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)
- On the simplex algorithm initializing (Q1938217) (← 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 basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
- Phase I cycling under the most-obtuse-angle pivot rule (Q2484337) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
