Separable Programming: A Dynamic Programming Approach

Stefan M. Stefanov ()
Additional contact information
Stefan M. Stefanov: South-West University Neofit Rilski

Chapter Chapter 4 in Separable Optimization, 2021, pp 85-129 from Springer

Abstract: Abstract This chapter is devoted to the dynamic programming approach for solving (separable) programs for both discrete and continuous cases. The Lagrange multiplier method for reducing the dimensionality of the problem is discussed, and some separable and other models are reviewed at the end of the chapter.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-78401-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9783030784010

DOI: 10.1007/978-3-030-78401-0_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().