This work deals with the problem of global optimization of processes (GOP). As a result of dynamic modeling of processes in chemical technology we usually obtain the set of differential equations. Optimization of these processes is often complicated by the presence of non-convexities. In recent years many methods were introduced, which solve global optimization problems. In this work deterministic spatial branch and bound optimization algorithm is used for finding the solution of GOP. Three techniques for computing bounds on variables participating in convex relaxation of original problem are proposed. Selected examples are solved for problems with processes described by ordinary differential parameter-dependent equations.
author | = | {R. Paulen}, |
title | = | {Global Optimization of Processes}, |
school | = | {\'UIAM FCHPT STU v Bratislave}, |
year | = | {2008}, |
address | = | {Radlinsk\'eho 9, 812 37 Bratislava}, |
annote | = | {This work deals with the problem of global optimization of processes (GOP). As a result of dynamic modeling of processes in chemical technology we usually obtain the set of differential equations. Optimization of these processes is often complicated by the presence of non-convexities. In recent years many methods were introduced, which solve global optimization problems. In this work deterministic spatial branch and bound optimization algorithm is used for finding the solution of GOP. Three techniques for computing bounds on variables participating in convex relaxation of original problem are proposed. Selected examples are solved for problems with processes described by ordinary differential parameter-dependent equations.}, |
supervisor | = | {prof. Ing. Miroslav Fikar, DrSc.}, |
url | = | {https://www.uiam.sk/assets/publication_info.php?id_pub=653} |