Global optimization of nonconvex bilevel problems: implementation and computational study of the Branch-and-Sandwich algorithm
File(s)escape26-basbl.pdf (127.58 KB)
Accepted version
Author(s)
Paulavicius, R
Kleniati, P-M
Adjiman, CS
Type
Conference Paper
Abstract
We describe BASBL, an implementation of the Branch-and-Sandwich deterministic global optimization algorithm,
(Kleniati and Adjiman, J. Glob. Opt. 60, 425–458, 2014), for nonlinear bilevel problems, within
the MINOTAUR toolkit. The algorithm is extended to include heuristics for branching and node selection. The
computational performance of the bilevel solver is analyzed for different combinations of the heuristics by
solving nonconvex bilevel test problems from the literature.
(Kleniati and Adjiman, J. Glob. Opt. 60, 425–458, 2014), for nonlinear bilevel problems, within
the MINOTAUR toolkit. The algorithm is extended to include heuristics for branching and node selection. The
computational performance of the bilevel solver is analyzed for different combinations of the heuristics by
solving nonconvex bilevel test problems from the literature.
Date Issued
2016-06-25
Date Acceptance
2016-02-24
Citation
Computer Aided Chemical Engineering, 2016, 38, pp.1977-1982
ISSN
1570-7946
Publisher
Elsevier
Start Page
1977
End Page
1982
Journal / Book Title
Computer Aided Chemical Engineering
Volume
38
Copyright Statement
© 2016 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Sponsor
Engineering & Physical Science Research Council (EPSRC)
Grant Number
EP/J003840/1
Source
26th European Symposium on Computer Aided Process Engineering (ESCAPE 26)
Subjects
Chemical Engineering
Publication Status
Published
Start Date
2016-06-12
Finish Date
2016-06-15
Coverage Spatial
Portorož, Slovenia