Affine-scaling for linear programs with free variables

Research output: Contribution to journalArticle

31 Scopus citations

Abstract

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.

Original languageEnglish (US)
Pages (from-to)31-44
Number of pages14
JournalMathematical Programming
Volume43
Issue number1-3
DOIs
StatePublished - Jan 1 1989
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Affine-scaling for linear programs with free variables'. Together they form a unique fingerprint.

  • Cite this