Accession Number:

AD0636511

Title:

THE FORMULATION OF SOME ALLOCATION AND CONNECTION PROBLEMS AS INTEGER PROGRAMS.

Descriptive Note:

Corporate Author:

UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES DEPT OF ELECTRICAL ENGINEERING

Personal Author(s):

Report Date:

1966-03-01

Pagination or Media Count:

14.0

Abstract:

In this paper a component placement problem and a digital computer backboard wiring problem are formulated as integer linear programs. The component placement problem consists of making a unique assignment of components to column positions such that wireability is maximized. The backboard wiring problem consists of three interrelated subproblems, namely, the placement, the connection, and the routing problems. The placement and connection problems are combined and solved as one, thereby giving the optimal circuit connections as well as minimizing the total lead length. It is shown that under certain assumptions, the number of inequalities and variables in the problem can be greatly reduced. Further simplifying assumptions lead to a near optimal solution. Examples of other allocation problems to which the models presented here are applicable are given. The following concepts are formulated as linear inequalities 1 the absolute magnitude of the difference between two variables 2 minimize the minimum function of a set of functions and 3 counting the number of 0, 1 adjacent component pairs in a vector. Author

Subject Categories:

  • Operations Research
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE