A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems

Arnold P. Jones and Richard M. Soland
Additional contact information
Arnold P. Jones: Research Analysis Corporation
Richard M. Soland: Research Analysis Corporation

Management Science, 1969, vol. 16, issue 1, 67-76

Abstract: Multi-level fixed-charge problems are mathematical optimization problems in which the separable portion of the objective function is the sum of piecewise continuous functions of a single variable. This paper describes a branch-and-bound algorithm that will find a global solution to this type of problem. The algorithm has the feature that a good feasible solution is generated at the start. Moreover, at each step of the algorithm an additional feasible solution may be generated for comparison with the best solution found previously.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.1.67 (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:ormnsc:v:16:y:1969:i:1:p:67-76

Access Statistics for this article

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