Nonadjacent extreme point methods for solving linear programs

Hanif D. Sherali, Allen L. Soyster and Stafford G. Baines

Naval Research Logistics Quarterly, 1983, vol. 30, issue 1, 145-161

Abstract: In this article we present some advanced basis or block‐pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex‐based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive.

Date: 1983
References: Add references at CitEc
Citations:

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

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:30:y:1983:i:1:p:145-161

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 ().