The Continuous Multiple Modular Design Problem

Abstract

In the present paper the authors extend recent work on the continuous single module design problem to the multiple module case. It is assumed that there is a fixed cost associated with each additional module used to solve the problem. The Kuhn-Tucker conditions characterize local optima among which is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch and bound, partial enumeration and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1972
Accession Number
AD0739728

Entities

People

  • Gerald L. Thompson
  • Timothy L. Shaftel

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Data Processing
  • Decomposition
  • Direction Finding
  • Equations
  • Heuristic Methods
  • Integrals
  • Mathematics
  • Military Research
  • Operations Research
  • Parametric Programming
  • Schools
  • Standards
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Software Engineering