Accession Number:

AD0623097

Title:

MODULAR DESIGN, GENERALIZED INVERSES, AND CONVEX PROGRAMMING

Personal Author(s):

Corporate Author:

RESEARCH ANALYSIS CORP MCLEAN VA

Report Date:

1965-07-01

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.

Descriptive Note:

Technical paper

Supplementary Note:

Prepared in cooperation with Northwestern Univ., Evanston, Ill., Contract Nonr-1228(10). DOI: 10.21236/AD0623097

Pages:

0017

Identifiers:

Subject Categories:

Communities Of Interest:

Distribution Statement:

Approved for public release; distribution is unlimited.

Contract Number:

DA-44-188-AR-01

File Size:

2.68MB