The Development of a Linear/Dynamic Program to Optimize the Sixth Fleet Logistic Force Scheduling.

Abstract

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 linear/dynamic 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, Gomory's 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)

Document Details

Document Type
Technical Report
Publication Date
May 30, 1972
Accession Number
AD0749707

Entities

People

  • Lawrence R. Albert

Organizations

  • United States Naval Academy

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Convergence
  • Efficiency
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Precision
  • Refueling
  • Scheduling (Production)
  • Simplex Method
  • Transportation

Readers

  • Computer Programming and Software Development.
  • Operations Research