Linear Programming and Sequential Decisions
Alan S. Manne · Management Science · 1960
Using an illustration drawn from the area of inventory control, this paper demonstrates how a typical sequential probabilistic model may be formulated in terms of (a) an initial decision rule and (b) a Markov process, and then optimized by means of linear programming. This linear programming technique may turn out to be an efficient alternative to the functional equation approach in the numerical analysis of such problems. Regardless of computational significance, however, it is of interest that there should be such a close relationship between the two traditionally distinct areas of dynamic programming and linear programming.
Cited by 432 works. doi:10.1287/mnsc.6.3.259
Authors
References
- Dynamic Programming
- Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil
- The Inventory Problem: I. Case of Known Distributions of Demand
- Linear Programming Under Uncertainty
- A Linear Decision Rule for Production and Employment Scheduling
- An Inventory Policy for a Case of Lagged Delivery
- The Use of Storage Water in a Hydroelectric System
- On the Optimality of Pure Strategies
- The Application of Linear Programming to Team Decision Problems