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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1969
Accession Number
AD0691056

Entities

People

  • D. W. Walkup

Organizations

  • Boeing

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Errors
  • Launch Vehicles
  • Mathematical Analysis
  • Mathematics
  • Procedures (Computers)
  • Scientific Research
  • Sequences
  • Space Missions
  • Spacecraft Components
  • Vehicle Design
  • Vehicles

Readers

  • Aerospace Test and Evaluation
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Statistical inference.

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers