Category:Solution characterization

From mintOC
Revision as of 19:54, 20 January 2016 by JonasSchulze (Talk | contribs) (Text replacement - "\<bibref\>(.*)\<\/bibref\>" to "<bib id="$1" />")

Jump to: navigation, search

The classification that we propose for switching decisions is based on insight from Pontryagin's maximum principle [Pontryagin1962]Address: Chichester
Author: Pontryagin, L.S.; Boltyanski, V.G.; Gamkrelidze, R.V.; Miscenko, E.F.
Publisher: Wiley
Title: The Mathematical Theory of Optimal Processes
Year: 1962
Link to Google Scholar applied here only to the relaxation of the binary control functions \omega(\cdot), denoted by \alpha(\cdot) \in [0,1]^{n_\omega}. In the analysis of linear control problems one distinguishes three cases: bang-bang arcs, sensitivity-seeking arcs, and path-constrained arcs, [Srinivasan2003]Author: Srinivasan, B.; Palanki, S.; Bonvin, D.
Journal: Computers \& Chemical Engineering
Pages: 1--26
Title: Dynamic Optimization of Batch Processes: I. Characterization of the Nominal Solution
Volume: 27
Year: 2003
Link to Google Scholar, where an arc is defined to be a nonzero time-interval. Of course a problem's solution can show two or even all three behaviors at once on different time arcs.

Additionally we characterize solutions, whenever chattering or sliding mode behavior occurs.

References

<bibreferences/>

Subcategories

This category has the following 5 subcategories, out of 5 total.

B

C

P

S

Retrieved from "https://mintoc.de/index.php?title=Category:Solution_characterization&oldid=1363"