MODULAR DESIGN, GENERALIZED INVERSES, AND CONVEX PROGRAMMING

Abstract

It is shown that a modular design problem can be transformed into a problem of minimizing a separable convex function subject to linear equality constraints and nonnegativities. This transformation is effected by using a generalized inverse of the constraint matrix. Moreover the nature of the functional and the constraints of the separable problem are such that a good starting point for its solution can be obtained by solving a particular transportation problem. Several possible methods for solving the separable problem are discussed, and the results of our computational experience with these methods are given. It is also shown that the modular design problem can be viewed as a special case of a large class of general engineering design problems that have been discussed in the literature.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1965
Accession Number
AD0623097

Entities

People

  • Abraham Charnes
  • Michael J. Kirby

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programming
  • Convex Programming
  • Engineering
  • Equations
  • Inequalities
  • Linear Programming
  • Literature
  • Mathematical Programming
  • Matrix Theory
  • Nonlinear Programming
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Software Engineering
  • Systems Analysis and Design