Accession Number : ADA186381

Title :   Deployment Planning: A Linear Programming Model with Variable Reduction.

Descriptive Note : Master's thesis,

Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Personal Author(s) : Collier, K S

PDF Url : ADA186381

Report Date : Sep 1987

Pagination or Media Count : 72

Abstract : The United States Armed Forces must be capable of deploying to areas of operations anywhere in the world. Planning for these deployments of the responsibility of the Joint Deployment Agency. MacDill Air Force Base, Tampa, Florida. Deployment plans are large and complex. A straightforward linear programming model of a deployment plan could easily exceed 700 million decision variables. This study outlines the development of a system used to assist planners in determining deployment plan feaseibility and in selecting modes of transportation. The system consists of a data input array, an algorithm to eliminate all unuseable variables, and a linear programming model. The largest scenario considered in this study is a 90-day deployment plan with 90 movement requirements, 9 types of lift assets, traveling between 22 ports. The corresponds to a linear programming model with 35 million decision variables. The variable reduction algorithm reduced the number of decision variables to 11,100, and an optimal solution was found in a total computation time (input, reduction, optimization, output) time of 6.5 minutes. (Theses)

Descriptors :   *DEPLOYMENT, *MILITARY PLANNING, ALGORITHMS, ARRAYS, COMPUTATIONS, DATA PROCESSING, DECISION MAKING, INPUT, LINEAR PROGRAMMING, MATHEMATICAL MODELS, MILITARY FORCES(UNITED STATES), OPTIMIZATION, PLANNING, REDUCTION, SOLUTIONS(GENERAL), THESES, TIME, TRANSPORTATION, VARIABLES, JOINT MILITARY ACTIVITIES

Subject Categories : Military Forces and Organizations

Distribution Statement : APPROVED FOR PUBLIC RELEASE