J Austral Math Soc Ser A 43 pp137--142, 1987.

Stationarity in the Simplex Methods

Neil Cameron

(Received 1 October 1985)

Abstract

Degeneracies occur with increasing frequency in some large scale linear programming problems, but with a simple change to the (revised) simplex method, resulting stationarity of the algorithm can be reduced. The method introduced here may also prevent cycling; neither the lexicographic refinement of Dantzig, Orden and Wolfe nor the perturbation technique of Charnes may be required to prevent cycling.

1980 AMS Subject Classification: 90C05, 90C06, 65K05

Browse the article

Read the article in your browser. (Scale your print to fit your paper).

Authors

Neil Cameron
Department of Mathematics, Monash University, Clayton, Victoria 3168, Australia.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Wed Feb 26 16:48:07 2003

© Copyright 1997-2004 Australian Mathematical Society