On solution-containing ellipsoids in linear programming

I. C. Choi, D. Goldfarb

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


Ellipsoids that contain all optimal dual slack solutions and those that contain all optimal primal solutions and that are independent of the algorithm used are derived. Based upon these ellipsoids, two criteria each for detecting optimal basic and nonbasic variables prior to optimality in interior-point methods are obtained. Using these results, we then derive a sufficient condition for a linear program to be feasible.

Original languageEnglish
Pages (from-to)161-173
Number of pages13
JournalJournal of Optimization Theory and Applications
Issue number1
Publication statusPublished - 1994 Jan
Externally publishedYes


  • Linear programming
  • containing ellipsoids
  • interior point methods
  • optimal basic and nonbasic variables

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research


Dive into the research topics of 'On solution-containing ellipsoids in linear programming'. Together they form a unique fingerprint.

Cite this