4.6 Article

BASBL: Branch-And-Sandwich BiLevel solver. Implementation and computational study with the BASBLib test set

Journal

COMPUTERS & CHEMICAL ENGINEERING
Volume 132, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2019.106609

Keywords

Nonconvex bilevel programming; Branch-and-Sandwich algorithm; Optimization software; BASBL solver; MINOTAUR toolkit; BASBLib

Funding

  1. Leverhulme Trust
  2. EPSRC [EP/J003840/1]
  3. Research Council of Lithuania [S-MIP-17-67]
  4. EPSRC [EP/J014958/1, EP/J003840/1] Funding Source: UKRI

Ask authors/readers for more resources

We describe BASBL, our implementation of the deterministic global optimization algorithm Branch-and-Sandwich for a general class of nonconvex/nonlinear bilevel problems, within the open-source MINOTAUR framework. The solver incorporates the original Branch-and-Sandwich algorithm and modifications proposed in (Paulavicius and Adjiman, J. Glob. Opt., 2019, Submitted). We also introduce BASBLib, an extensive online library of bilevel benchmark problems collected from the literature and designed to enable contributions from the bilevel optimization community. We use the problems in the current release of BASBLib to analyze the performance of BASBL using different algorithmic options and we identify a set of default options that provide good overall performance. Finally, we demonstrate the application of BASBL to a set of flexibility index problems including linear and nonlinear constraints. (C) 2019 Published by Elsevier Ltd.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available