The Development of a Linear/Dynamic Program to Optimize the Sixth Fleet Logistic Force Scheduling.
NAVAL ACADEMY ANNAPOLIS MD
Pagination or Media Count:
An attempt has been made to make up a schedule for the oilers in their complicated task of refueling the Sixth Fleet Combatant Force through the development of a lineardynamic program. Linear programming efficiency and the exactness of a transportation model were combined in an approach to the problem based on a binary methodology. It was necessary to develop a means of introducing sequencing essential to the problem, to the simplex algorithm, which was accomplished through the use of a series of logic constraint. The program successfully solved small scale problems through the use of a combination of the simplex, Gomorys cutting-plane and the dual-simplex algorithms. However, before the final solution was generated, computer round-off error destroyed the convergence of the algorithms. Author
- Operations Research