I. S. Litvinchev INFORMS, Cincinnati, Spring 1999 , 01.1999 , p. 46, 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. The ellipsoids are used to formulate criteria for identifying the optimal basic and nonbasic variables.  Ключевые слова optimal solutions, linear programming problem, interior-point methods, eliipsoids