50. On polytopal branch and bound
Invited abstract in session TC-4: Global Optimization advances, stream Global optimization.
Tuesday, 14:00-16:00Room: B100/5013
Authors (first author is the speaker)
| 1. | Eligius M.T. Hendrix
|
| Computer Architecture, Universidad de Málaga | |
| 2. | Boglárka G.-Tóth
|
| Department of Computational Optimization, University of Szeged | |
| 3. | Leocadio G. Casado
|
| Computer Science, Universidad de Almeria (ceiA3) | |
| 4. | Frédéric MESSINE
|
| LAPLACE-ENSEEIHT-INPT University of Toulouse |
Abstract
Using Interval Arithmetic or simplicial Branch and bound exploiting monotonicity, our investigation turned to the question of using polytopal subsets for global optimization over a polytope feasible set. We derived underlying theory. However, to come to practical implementations of a Branch and bound code requires well thinking on how to store information of polytopes and the feasibele set. In this contribution, we report on our investigation during the last year and the challenges that remain.
Keywords
- Global optimization
- Linear and nonlinear optimization
Status: accepted
Back to the list of papers