RELAXATION METHODS FOR LINEAR PROGRAMS.

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

In this paper we propose a new method for solving linear programs. This method may be viewed as a generalized coordinate descent method whereby the descent directions are chosen from a finite set. The generation of the descent directions are based on the results from monotropic programming theory. The method may be alternatively viewed as an extension of the relaxation method for network flow problems. Node labeling, cuts, and flow augmentation paths in the network case correspond to, respectively, tableau pivoting, rows of tableaus, and columns of tableaus possessing special sign patterns in the linear programming case.

Original languageEnglish (US)
Pages (from-to)569-596
Number of pages28
JournalMathematics of Operations Research
Volume12
Issue number4
DOIs
StatePublished - 1987
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'RELAXATION METHODS FOR LINEAR PROGRAMS.'. Together they form a unique fingerprint.

Cite this