Nonextreme point solution strategies for linear programs

Leon Cooper and Jeff Kennington

Naval Research Logistics Quarterly, 1979, vol. 26, issue 3, 447-461

Abstract: This exposition presents two algorithms for linear programs which allow a value change in more than one nonbasic variable at each iteration. The computational formulae are developed and errors which have appeared in the literature are noted. One algorithm is a multiple basis exchange procedure while the second is a feasible direction method. There remain many computational challenges in the area of linear programming and we hope that this investigation will encourage additional work in the directions indicated in this exposition.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800260308

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:26:y:1979:i:3:p:447-461

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().