Pages that link to "Item:Q2475881"
From MaRDI portal
The following pages link to A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881):
Displaying 10 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- 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)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471) (← links)
- Phase I cycling under the most-obtuse-angle pivot rule (Q2484337) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm† (Q3620911) (← links)
- Dual–primal algorithm for linear optimization (Q4924118) (← links)
- An interesting characteristic of phase-1 of dual–primal algorithm for linear programming (Q5746711) (← links)
