SOME LINEAR PROGRAMMING APPLICATIONS TO STOCKAGE PROBLEMS

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.