The Maximum Principle: Discrete Time

Suresh Sethi

Chapter 8 in Optimal Control Theory, 2021, pp 239-260 from Springer

Abstract: Abstract For many purposes it is convenient to assume that time is discrete and not continuous. This is particularly true when we wish to solve a large control theory problem using a computer. It is also desirable, even when solving small problems that have state or adjoint differential equations whose solutions cannot be expressed in closed form, to formulate them as discrete problems and solve them on a computer in a stepwise manner. This chapter is devoted to deriving a discrete-time maximum principle by using the necessary Kuhn-Tucker conditions for optimizing nonlinear programming problems along with a brief discussion of the required constraint qualifications. To follow this procedure, we must make some simplifying assumptions and hence obtain only a restricted form of the discrete maximum principle. In Sect. 8.3, we state without proof a more general form of the discrete maximum principle. There are many exercises 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:sptchp:978-3-030-91745-6_8

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

DOI: 10.1007/978-3-030-91745-6_8

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().