A note on a modified primal‐dual algorithm to speed convergence in solving linear programs

Harold Greenberg

Naval Research Logistics Quarterly, 1969, vol. 16, issue 2, 271-273

Abstract: The primal‐dual algorithm is modified in a two part procedure. In the first part, the pivot row is selected so that an artificial variable is always dropped. The end of the first part usually produces some basic variables with negative values. The second part consists of selecting the most negative basic variable. The equation, represented by the selected basic variable, is multiplied through by minus one and then added to all equations with negative basic variables; it is then augmented by an artificial variable. This procedure produces feasibility for all basic variables and maintains canonical form. The standard primal‐dual method is then used to complete the solution. Computational results are presented.

Date: 1969
References: Add references at CitEc
Citations:

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

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:16:y:1969:i:2:p:271-273

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