A Monotonic Build-Up Simplex Algorithm for Linear Programming (1991)

Cached

Download Links

by K. M. Anstreicher , T. Terlaky
Citations:4 - 1 self

Documents Related by Co-Citation

11 Complementarity in Oriented Matroids – M J Todd - 1984
4 The equivalence of Dantzig's Self-Dual Parametric Algorithm for Linear Programs to Lemke's Algorithm for Linear Complementarity Problems Applied to Linear Programming – I Lustig - 1987
15 Linear and Quadratic Programming in Oriented Matroids – M Todd - 1985
21 Oriented matroid programming – K Fukuda - 1982
797 Linear Programming and Extensions – G B Dantzig - 1963
11 The criss-cross method for solving linear programming problems – S Zionts - 1969
2 A new efficient primal dual simplex algorithm. Computer and operation research 30,1383-1399 – K PAPARRIZOS, ET AL - 2003
2 The Simplex Algorithm with a New Primal and Dual Pivot Rule – Hsin-der Chen, Panos M. PARDALOS, Michael A. Saunders - 1993
1 Resolution of the problem of degeneracy in a primal and dual simplex algorithm – K DOSIOS, K PAPARRIZOS - 1997
1 An interior-point method for fractional programs with convex constraints. Mathematical Programming 67 – W F ROLAND, FLORIAN JARRE 1994 - 2005
1 A Parametric Method for Solving the Linear Fractional Programming Problem – H WOLF - 1985
3 A feasible direction method for linear programming – K G Murty, Y Fathi - 1984
15 Combining interior-point and pivoting algorithms for linear programming – Erling D. Andersen , Yinyu Ye - 1995
279 Introduction to operations research – F Hillier, G Lieberman - 2001
2 Optimality and degeneracy in linear programming, Econometrica 20(1952)160--170 – A Charnes - 1952
2 A class of cycling counter-examples to the EXPAND anti-cycling procedure – J Hall, K I McKinnon - 1998
2 Cycling in the simplex method – A J Hoffman - 1953
17 On Complementarity Pivot Theory – C E Lemke - 1968
3 Notes on linear programming: Part I -- The generalized simplex method for minimizing a linear form under linear inequality restrictions – G B Dantzig, A Orden, Ph Wolfe - 1955