DTIC ADA1025831: Solving Multiactivity Multifacility Capacity Constrained pdf

DTIC ADA1025831: Solving Multiactivity Multifacility Capacity Constrained

More Book Details

Description of the Book:

A branch-and-bound solution algorithm and a computer program implementing this algorithm are developed to solve multiactivity multifacility capacity-constrained 0-1 assignment problems. Such 0-1 integer programming problems have the objective of minimizing the sum of variable costs due to the assignment of the activities to designs and fixed costs due to the inclusion of the facilities chosen. The constraints ensure that each activity is assigned to a single design and that the capacities of the facilities chosen are not exceeded. Each design involves the use of one or more facilities, and the same design may be used by several activities. This document includes formulation of the problem, mathematical development of the branch-and-bound solution algorithm, a detailed test example, and computational test results using the computer program. The areas of application are identified, and consideration for further improvement of the branch-and-bound solution algorithm are also included. (Author

• Creator/s: Defense Technical Information Center
• Date: 5/12/1981
• Year: 1981
• Book Topics/Themes: DTIC Archive, Chhabra, Krishan Lal, GEORGE WASHINGTON UNIV WASHINGTON DC PROGRAM IN LOGISTICS, *COMPUTERIZED SIMULATION, *DECISION MAKING, *INTEGER PROGRAMMING, COMPUTER PROGRAMS, ALGORITHMS, COST ANALYSIS, THESES, VARIABLES, FORTRAN, LAGRANGIAN FUNCTIONS, FAULT TREE ANALYSIS, THEOREMS, BINARY NOTATION

An excerpt captured from the PDF book