Pages that link to "Item:Q5668237"
From MaRDI portal
The following pages link to A comparison of the primal‐simplex and complementary pivot methods for linear programming (Q5668237):
Displaying 8 items.
- Computer experiments on quadratic programming algorithms (Q1154392) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- An artificial-free simplex-type algorithm for general LP models (Q1362223) (← links)
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy (Q1406107) (← links)
- A computationally stable solution algorithm for linear programs (Q2372034) (← links)
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method (Q2571997) (← links)
- Variational Inequality and Complementarity Problem (Q2912148) (← links)
- An application of homotopy to solving linear programs (Q3040926) (← links)
