18th International Conference on Process Control

Tighter Convex Relaxations for Global Optimization Using alphaBB Based Approach

R. Paulen, M. Fikar
Slovak University of Technology in Bratislava

Abstract

This paper is devoted to investigation of certain issues that appear in solving of deterministic global optimization problems (GOPs). Basically, we focus ourselves on introducing a procedure which may serve to establish tighter convex relaxations for a certain class of non-convex optimization problems. Tightness of these convex relaxations plays important role in speeding of the convergence of branch-and-bound algorithm which is used as a basic framework of solving GOPs in this study. Two case studies are solved where it is shown how significant improvement can be achieved by considering proposed framework.

Full paper

030.pdf

Session

Process Optimisation (Lecture)

Reference

Paulen, R.; Fikar, M.: Tighter Convex Relaxations for Global Optimization Using alphaBB Based Approach. Editors: Fikar, M. and Kvasnica, M., In Proceedings of the 18th International Conference on Process Control, Tatranská Lomnica, Slovakia, June 14 – 17, 537–542, 2011.

BibTeX
@inProceedings{pc2011-030,
author = {Paulen, R. and Fikar, M.},
title = {Tighter Convex Relaxations for Global Optimization Using alphaBB Based Approach},
booktitle = {Proceedings of the 18th International Conference on Process Control},
year = {2011},
pages = {537-542},
editor = {Fikar, M. and Kvasnica, M.},
address = {Tatransk\'a Lomnica, Slovakia},
publisher = {Slovak University of Technology in Bratislava},
url = {http://www.kirp.chtf.stuba.sk/pc11/data/papers/030.pdf}}
© 2011 Institute of Information Engineering, Automation and Mathematics, FCFT STU in Bratislava. All rights reserved.