AbstractThis 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.