The following pages link to (Q4435041):
Displayed 4 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)