An approximate solution method for the fixed charge problem

L. Cooper and C. Drebes

Naval Research Logistics Quarterly, 1967, vol. 14, issue 1, 101-113

Abstract: In the absence, to date, of an exact method for solving the linear programming problem with fixed charges, two heuristic methods have been proposed and extensively investigated, computationally, for moderate sized problems. The results indicate that the heuristic methods produce optimal solutions in well over 90 percent of the several hundred problems investigated and very close to optimal (a few percent) in the remaining cases. Hence it should be of practical significance to practitioners in the field.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (5)

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

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:14:y:1967:i:1:p:101-113

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