The computational algorithm for the parametric objective function

Saul Gass and Thomas Saaty

Naval Research Logistics Quarterly, 1955, vol. 2, issue 1‐2, 39-45

Abstract: If a linear programming problem involves two objective functions, it is desirable to learn all solutions depending on the relative weight attached to the two functions. This paper presents details of an algorithm which finds these solutions systematically.

Date: 1955
References: Add references at CitEc
Citations: View citations in EconPapers (30)

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

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:2:y:1955:i:1-2:p:39-45

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