An easy solution for a special class of fixed charge problems

Patrick G. McKeown and Prabhakant Sinha

Naval Research Logistics Quarterly, 1980, vol. 27, issue 4, 621-624

Abstract: The fixed charge problem is a mixed integer mathematical programming problem which has proved difficult to solve in the past. In this paper we look at a special case of that problem and show that this case can be solved by formulating it as a set‐covering problem. We then use a branch‐and‐bound integer programming code to solve test fixed charge problems using the setcovering formulation. Even without a special purpose set‐covering algorithm, the results from this solution procedure are dramatically better than those obtained using other solution procedures.

Date: 1980
References: Add references at CitEc
Citations:

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

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:27:y:1980:i:4:p:621-624

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