Deployment Planning: A Linear Programming Model with Variable Reduction.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1987
- Accession Number
- ADA186381
Entities
People
- K. S. Collier
Organizations
- Naval Postgraduate School