The objective of this work is solving problems of dynamic, global and global dynamic optimization. The first chapter deals with dynamic optimization. It consists of the problem formulation and description of two analytical methods of its solution -- the calculus of variations and Pontryagin's minimum principle. These methods are used to solve the time-optimal control problem of a car with and without constraints on velocity. The second chapter deals with static and dynamic global optimization. One of the spatial branch-and-bound methods, used for solving of nonconvex problems, is described here. Two illustrative examples are solved using these methods which are based on convex relaxation.
author | = | {I. Rep\v{c}\'ikov\'a}, |
title | = | {Global and Dynamic Optimization of Processes}, |
school | = | {\'UIAM FCHPT STU v Bratislave}, |
year | = | {2010}, |
keyword | = | {Konvexn\'a Relax\'acia, Dynamick\'a Optimaliz\'acia, Nekonvexn\'e Optimaliza\v{c}n\'e Probl\'emy, Princ\'ip Minima, Varia\v{c}n\'y Po\v{c}et, Glob\'alna Optimaliz\'acia}, |
address | = | {Radlinsk\'eho 9, 812 37 Bratislava}, |
month | = | {07. 06. 2010}, |
annote | = | {The objective of this work is solving problems of dynamic, global and global dynamic optimization. The first chapter deals with dynamic optimization. It consists of the problem formulation and description of two analytical methods of its solution -- the calculus of variations and Pontryagin's minimum principle. These methods are used to solve the time-optimal control problem of a\ car with and without constraints on velocity. The second chapter deals with static and dynamic global optimization. One of the spatial branch-and-bound methods, used for solving of nonconvex problems, is described here. Two illustrative examples are solved using these methods which are based on convex relaxation.}, |
supervisor | = | {doc. Ing. Radoslav Paulen, PhD.}, |
url | = | {https://www.uiam.sk/assets/publication_info.php?id_pub=923} |