Accession Number : AD0663825

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

Descriptive Note : Technical paper,

Corporate Author : RESEARCH ANALYSIS CORP MCLEAN VA

Personal Author(s) : Jones,Arnold P. ; Soland,Richard M.

Report Date : OCT 1967

Pagination or Media Count : 24

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)

Descriptors :   (*MATHEMATICAL PROGRAMMING, *ALGORITHMS), COSTS, PROBLEM SOLVING, OPTIMIZATION, FLOW CHARTING, CONVEX SETS, COMPUTER PROGRAMMING, INEQUALITIES

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE