I. S. Litvinchev Abstracts of the 2nd Moscow International Conference on Operations Research, Moscow, Russia, 1998 , 01.1998 , p. 21, language: английский  Аннотация Ellipsoids are proposed that contain optimal solutions of the primal and/or dual linear programming problem and do not depend on the method used to solve the original formulation. It is shown that many well-known interior-point methods realize descents toward the centers of ellipsoids.  Ключевые слова optimal solutions, linear programming problem, interior-point methods, ellipsoids