Modifications and implementation of the ellipsoid algorithm for linear programming

We give some modifications of the ellipsoid algorithm for linear programming and describe a numerically stable implementation. We are concerned with practical problems where user-supplied bounds can usually be provided. Our implementation allows constraint dropping and updates bounds on the optimal value, and should be able to terminate with an indication of infeasibility or with a provably good feasible solution in a moderate number of iterations.

[1]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[2]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[3]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[4]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[5]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[6]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[7]  D. J. Newman,et al.  Location of the Maximum on Unimodal Surfaces , 1965, JACM.

[8]  J. M. Bennett.  Triangular factors of modified matrices , 1965 .

[9]  Yu. M. Ermol’ev.  Methods of solution of nonlinear extremal problems , 1966 .

[10]  N. Z. Shor.  The rate of convergence of the generalized gradient descent method , 1968 .

[11]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[12]  D. Goldfarb.  Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .

[13]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[14]  N. Z. Shor.  Convergence rate of the gradient descent method with dilatation of the space , 1970 .

[15]  N. Z. Shor.  Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .

[16]  W. E. Gentleman.  Least Squares Computations by Givens Transformations Without Square Roots , 1973 .

[17]  M. Powell,et al.  On the Modification of LDL T Factorizations , 1974 .

[18]  P. Gill,et al.  Methods for computing and modifying the $LDV$ factors of a matrix , 1975 .

[19]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[20]  M. Todd,et al.  The Ellipsoid Method: A Survey , 1980 .

[21]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[22]  P. Gács,et al.  Khachiyan’s algorithm for linear programming , 1981 .