Separable Programming: A Dynamic Programming Approach
This chapter is devoted to the dynamic programming approach for solving (separable) programs for both discrete and continuous cases. The Lagrange multipliers method for reducing the dimensionality of the problem is discussed, and some separable and other models are reviewed at the end of the chapter.
KeywordsKnapsack Problem Inventory Level Order Quantity Setup Cost Lagrange Multiplier Method
Unable to display preview. Download preview PDF.