Pages that link to "Item:Q5436927"
From MaRDI portal
The following pages link to Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927):
Displaying 8 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← 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)
- A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758) (← links)
- On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds (Q5413870) (← links)
- Portfolio selection based on extended Gini shortfall risk measures (Q6139263) (← links)