A mutual primal‐dual linear programming algorithm

Milton Y. Harris

Naval Research Logistics Quarterly, 1970, vol. 17, issue 2, 199-206

Abstract: A new primal‐dual linear programming algorithm is exhibited. A proof is given that optimal solutions to both primal and dual problems (when such solutions exist) are found in a finite number of steps by this algorithm. A numerical example is included to illustrate the method.

Date: 1970
References: Add references at CitEc
Citations:

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

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:17:y:1970:i:2:p:199-206

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