BOLIB: bilevel Optimization LIBrary of test problems

DOI10.1007/978-3-030-52119-6_19MaRDI QIDQ5014641zbMATH OpenOpenAlexFDO

Authors Sheng-Long Zhou, Alain B. Zemkoho, Andrey Tin

Publication date 8 December 2021

Published in Bilevel Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.00230, https://eprints.soton.ac.uk/436854/1/BOLIBver2.pdf

zbMATH Keywords

bilevel optimizationnumerical methodstest problemsMatlab codeslibrary of examples

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Research data for problems pertaining to operations research and mathematical programming (90-11)

Abstract: This chapter presents the Bilevel Optimization LIBrary of the test problems (BOLIB for short), which contains a collection of test problems, with continuous variables, to help support the development of numerical solvers for bilevel optimization. The library contains 173 examples with 138 nonlinear, 24 linear, and 11 simple bilevel optimization problems. This BOLIB collection is probably the largest bilevel optimization library of test problems. Moreover, as the library is computationenabled with the MATLAB m-files of all the examples, it provides a uniform basis for testing and comparing algorithms. The library, together with all the related codes, is freely available at biopt.github.io/bolib.

Recommendations

• Bilevel optimization: theory, algorithms, applications and a bibliography
• Test problem generation for quadratic-linear pessimistic bilevel optimization
• Numerical solution of a linear bilevel problem
• Test problem construction for linear bilevel programming problems
• Generating Linear and Linear-Quadratic Bilevel Programming Problems

Cites work

• scientific article; zbMATH DE number 978735 (Why is no real title available?)
• scientific article; zbMATH DE number 1163120 (Why is no real title available?)
• scientific article; zbMATH DE number 3356443 (Why is no real title available?)
• scientific article; zbMATH DE number 970346 (Why is no real title available?)
• A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• A bridge between bilevel programs and Nash games
• A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
• A global optimization approach for the linear two-level program
• A global optimization method for solving convex quadratic bilevel programming problems
• A hybrid neural network approach to bilevel programming problems
• A necessary and a sufficient optimality condition for bilevel programming problems
• A new computational method for Stackelberg and min-max problems by use of a penalty method
• A note on the optimality conditions for the bilevel programming problem
• A novel approach to bilevel nonlinear programming
• A quasiconcave minimization method for solving linear two-level programs
• A smoothing method for mathematical programs with equilibrium constraints
• A solution method for the linear static Stackelberg problem using penalty functions
• A solution method for the static constrained Stackelberg problem via penalty method
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• An inertial extrapolation method for convex simple bilevel optimization
• Bilevel polynomial programs and semidefinite relaxation methods
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
• Characterizing an optimal solution to the linear bilevel programming problem
• Characterizing optimality in mathematical programming models
• Computational Difficulties of Bilevel Linear Programming
• Convex two-level optimization
• DC programming techniques for solving a class of nonlinear bilevel programs
• Dependence of bilevel mathematical programs on irrelevant constraints
• Double penalty method for bilevel optimization problems
• Existence theorems of equilibrium points in stackelberg
• Filled functions for unconstrained global optimization.
• First-order necessary optimality conditions for general bilevel programming problems
• Generating quadratic bilevel programming test problems
• Handbook of test problems in local and global optimization
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Linear bilevel programming with upper level constraints depending on the lower level solution
• Necessary optimality conditions for Stackelberg problems
• New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
• Numerically tractable optimistic bilevel problems
• On Optimization Problems with Variational Inequality Constraints
• On bilevel programming. I: General nonlinear cases
• On calmness conditions in convex bilevel programming
• On solving simple bilevel programs with a nonconvex lower level program
• On the implicit programming approach in a class of mathematical programs with equilibrium constraints
• On the numerical solution of a class of Stackelberg problems
• Optimality Conditions for a Simple Convex Bilevel Programming Problem
• Optimality conditions for the bilevel programming problem
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces
• Practical bilevel optimization. Algorithms and applications
• Sensitivity analysis for two-level value functions with applications to bilevel programming
• Solution algorithm for an optimistic linear Stackelberg problem
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• Solving bilevel linear programs using multiple objective linear programming
• Solving bilevel programs with the KKT-approach
• Some properties of the bilevel programming problem
• Stackelberg problems: subgame perfect equilibria via Tikhonov regularization
• The Theory of Moral Hazard and Unobservable Behaviour: Part I
• The bilevel linear/linear fractional programming problem
• Two-Level Linear Programming
• Weak and strong stationarity in generalized bilevel programming and bilevel optimal control

Cited in

(15)

• Scholtes relaxation method for pessimistic bilevel optimization
• Exploiting the polyhedral geometry of stochastic linear bilevel programming
• Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach
• Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
• Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
• Gauss-Newton-type methods for bilevel optimization
• Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
• BOLIB
• Exploiting the polyhedral geometry of stochastic linear bilevel programming
• A survey on mixed-integer programming techniques in bilevel optimization
• Presolving linear bilevel optimization problems
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
• Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
• A primal nonsmooth reformulation for bilevel optimization problems
• A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: BOLIB: bilevel Optimization LIBrary of test problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014641)