A BRANCH-AND-BOUND ALGORITHM FOR MULTILEVEL FIXED-COST PROBLEMS.

Abstract

Multilevel fixed-cost 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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1967
Accession Number
AD0663825

Entities

People

  • Arnold P. Jones
  • Richard M. Soland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Optimization

Fields of Study

  • Mathematics

Readers

  • Operations Research