Separable Programming: A Dynamic Programming Approach

  • Stefan M. Stefanov
Part of the Applied Optimization book series (APOP, volume 53)

Abstract

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.

Keywords

Knapsack Problem Inventory Level Order Quantity Setup Cost Lagrange Multiplier Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Stefan M. Stefanov
    • 1
  1. 1.Department of MathematicsSouth West UniversityBlagoevgradBulgaria

Personalised recommendations