Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem

Patrick McKeown
Additional contact information
Patrick McKeown: State University of New York, Albany, New York

Operations Research, 1975, vol. 23, issue 6, 1183-1191

Abstract: Murty has suggested that the linear fixed-charge problem can be solved by ranking the vertices of the polyhedral constraint set according to their continuous objective values and then adding the fixed charges to determine an optimal solution. Several problems involving degeneracy and inequality constraints arise when one attempts to implement Murty's method directly. This note describes a method that uses the vertex ranking approach in conjunction with procedures that resolve these difficulties. We also give computational results.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.6.1183 (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:23:y:1975:i:6:p:1183-1191

Access Statistics for this article

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