|Educational Research (ISSN:2141-5161) Vol. 3(10), pp. 762-765, October, 2012
Copyright © 2012 International Research Journals
On increasing the rate of convergence of the ellipsoid algorithm for linear programming
Adejo B. O*. and Okutachi A. M
Department of Mathematical Sciences, Kogi State University, Anyigba, Nigeria
*Corresponding Author E-mail: email@example.com
Received 25 August, 2012; Accepted 25 September, 2012
The ellipsoid method is widely believed to be theoretically significant but practically impoverished. Some methods have been proposed to speed up the rate of convergence of the ellipsoid method. However, improvements obtained by using such methods are still slow to convergence. We discuss such methods and highlight the significance of the ellipsoid method.
Keywords: Ellipsoid method, deep cuts, surrogate cuts and parallel cuts.