Solving the Fixed Charge Problem by Ranking the Extreme Points

Katta G. Murty
Additional contact information
Katta G. Murty: University of California, Berkeley, California

Operations Research, 1968, vol. 16, issue 2, 268-279

Abstract: An algorithm for ranking the basic feasible solutions corresponding to a linear programming problem in increasing order of the linear objective function is described. An application of this algorithm for obtaining the minimal cost solution to a fixed charge problem is given. This algorithm can be applied in general to solve any fixed charge problem. However, the algorithm works efficiently when the problem is nondegenerate and the range in the values of the variable costs is large compared to the fixed charges. This algorithm can also be applied when the fixed charge part of the cost function is replaced by a concave function.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.2.268 (application/pdf)

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:inm:oropre:v:16:y:1968:i:2:p:268-279

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().