Pages that link to "Item:Q1610181"
From MaRDI portal
The following pages link to New variants of finite criss-cross pivot algorithms for linear programming (Q1610181):
Displaying 14 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- Exact methods for large-scale multi-period financial planning problems (Q839841) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← 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)
- A note on two direct methods in linear programming (Q1827666) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
- (Q3372777) (← links)
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)
