Resolution of the problem of degeneracy in a primal and dual simplex algorithm

Operations Research Letters

Volumn 20, Issue 1, 1997, Pages 45-50

  Dosios, Konstantinos ^a   Paparrizos, Konstantinos ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Degeneracy; Exterior point simplex algorithm; Linear programming; Pivoting rules; Simplex method

Indexed keywords

EID: 0002206342     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(96)00008-9     Document Type: Article

References (16)

1. H. Achatz, P. Kleinschmidt and K. Paparrizos, "A dual forest algorithm for the assignment problem", DIMACS 4, 1-10 (1991).
2. K. Anstreicher and T. Terlaky, "A monotonie build-up simplex algorithm for linear programming", Oper. Res. 42, 556-561 (1994).
3. R.G. Bland, "New finite pivoting rules for the simplex method", Math. Oper. Res. 2, 103-107 (1977).
4. H. Chen, P.M. Pardalos and M.A. Saunders, "The simplex algorithm with a new primal and dual pivot rule", Oper. Res. Lett. 16, 121-127 (1994).
5. G.B. Dantzig, Linear Programming and Extensions, Princeton Univ. Press, Princeton, NJ, 1963.
6. K. Dosios and K. Paparrizos, "A new exterior point algorithm for linear programming problems", YUJOR 4, 137-148 (1994).
7. K. Dosios and K. Paparrizos, "A generalization of an exterior point simplex algorithm for linear programming problems" (submitted).
8. P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, "A practical anticycling procedure for linearly constrained optimisation", Math. Programming 45, 437-474 (1989).
9. M. Haimovich, "The simplex method is very good! - on the expected number of pivots steps and related properties of random linear programs". Dept. of IE and OR, Columbia University, New York, 1983.
10. V. Klee and G.J. Minty, How good is the simplex algorithm?, in: O. Shisha (ed.), Inequalities - III, Academic Press, New York (1972), pp. 159-175.
11. C.E. Lemke, 1965, "Bimatrix equilibrium points and mathematical programming", Management Sci. 11, 681-689 (1965).
12. K. Paparrizos, Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples", Opsearch 26 (1989).
13. K. Paparrizos, "An infeasible (exterior point) simplex algorithm for assignment problems", Math. Programming 51, 45-54 (1991).
14. K. Paparrizos, "An exterior point simplex algorithm for general linear problems", Ann. Oper. Res. 32, 497-508 (1993).
15. K. Paparrizos, "A nonimproving simplex method for transportation problem", RAIRO Oper Res. (under revision).
16. S. Zhang, "On anti-cycling pivoting rules of the simplex method", Oper. Res. Lett. 10, 189-192 (1989).