Accession Number:

AD0691056

Title:

CAVAP, A FORTRAN SUBROUTINE FOR SOLVING AN ASSIGNMENT PROBLEM WITH CONCAVE OBJECTIVE

Descriptive Note:

Corporate Author:

BOEING SCIENTIFIC RESEARCH LABS SEATTLE WA MATHEMATICS RESEARCH LAB

Personal Author(s):

Report Date:

1969-06-01

Pagination or Media Count:

18.0

Abstract:

The document describes a FORTRAN IV subroutine named CAVAP an acronym for conCAVe Assignment Problem which uses a branch and bound method to solve a variant of the assignment problem in which the objective to be minimized is concave. It is assumed that m tasks are to be performed and n different kinds of machines have been defined for possible use in performing them. It is assumed that total cost, which is to be minimized, is the sum of costs for each kind of machine, each of which is in turn a concave function of the number of machines of that type required. CAVAP has been used to solve a space fleet selection problem with 20 space missions tasks, 40 booster and spacecraft components machines, and a number of alternative launch vehicle configurations and combinations for each mission. Author

Subject Categories:

  • Administration and Management
  • Operations Research
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE