SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS,

Abstract

The report discusses the use of linear programming algorithms for solving Air Force stockage problems. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is 'fail safe' in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers.

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1967
Accession Number
AD0658823

Entities

People

  • Robin B. S. Brooks

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programming
  • Fail Safe
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Logistics and Supply Chain Management.
  • Systems Analysis and Design