Dynamic Optimization

Ramteen Sioshansi () and Antonio J. Conejo ()
Additional contact information
Ramteen Sioshansi: The Ohio State University
Antonio J. Conejo: The Ohio State University

Chapter Chapter 6 in Optimization in Engineering, 2017, pp 337-388 from Springer

Abstract: Abstract In this chapter we introduce a markedly different way to formulate and solve optimization problems, compared to the techniques that are introduced in Chapters 2 through 5 . The dynamic optimization methods that we introduce here work by decomposing an optimization problem into a successive set of stages, at which the state of the system being optimized is observed and decisions are made. Dynamic optimization techniques require that an optimization problem have certain important characteristics that allow for this decomposition. In this chapter we begin by first introducing a simple problem that can be formulated and solved as a dynamic optimization problem. We then discuss the common elements that must be identified when formulating a dynamic optimization problem and the standard algorithm used to solve them.

Date: 2017
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-319-56769-3_6

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

DOI: 10.1007/978-3-319-56769-3_6

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 ().