Answers are grounded in this paper and cite their sources.
This paper presents an optimization procedure which would offer a much simpler and faster procedure than dynamic programming in reaching optimal solutions for a special class of resource allocation problems. The solution method is based upon an incremental analysis and does not require further computation beyond the conversion of a payoff table to a table of marginal payoffs by simple subtractions. The optimality of the incremental solution will be demonstrated by a heuristic proof with several examples; and a numerical problem to illustrate the use of incremental analysis as well as to compare it with the solution procedure of dynamic programming will also be given.
No takes yet. Share an insight, caveat, or question.
Wei Shih (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: