Global optimization of nonlinear bilevel programming problems
The known approaches to bilevel programming problems (BLPP) normally reduce BLPP to an one level programming problem replacing the lower level minimization problem with equations of KKT conditions. However, strong assumptions should be satisfied in order to guarantee the solution to the last problem be also the solution to the original problem. The proposed approach, although uses the KKT conditions, can overcome the limitations of the previous methods. A developed method is based on the branch and bound framework known as \( \alpha\)BB. For the problems involving twice differentiable nonlinear nonconvex functions epsilon global optimality is theoretically guaranteed in finite number of iterations. Several known examples of BLPP problems are solved using the proposed method.
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
- A global convergent method for nonlinear bilevel programming problems
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of nonlinear mixed-integer bilevel programs
- Global optimization of mixed-integer bilevel programming problems
- Computational method for inferring objective function of glycerol metabolism in Klebsiella pneumoniae
- Global solution of bilevel programs with a nonconvex inner program
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem
- Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
- An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Solving bilevel programs with the KKT-approach
- Global solution of nonlinear mixed-integer bilevel programs
- Optimization problems for machine learning: a survey
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- Carbon tax based on the emission factor: a bilevel programming approach
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- A novel approach to bilevel nonlinear programming
- Parametric global optimisation for bilevel programming
- Global optimization of mixed-integer bilevel programming problems
- Bilevel programs with extremal value function: global optimality
- An SOS1-based approach for solving MPECs with a natural gas market application
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
- scientific article; zbMATH DE number 5618677 (Why is no real title available?)
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- scientific article; zbMATH DE number 770255 (Why is no real title available?)
- On a solving bilevel d.c.-convex optimization problems
- scientific article; zbMATH DE number 6452733 (Why is no real title available?)
- A method for a -global optimal solution of linear bilevel programming
- A global optimization method for a class of nonlinear bilevel integer programming
- scientific article; zbMATH DE number 970346 (Why is no real title available?)
- A computational study of global algorithms for linear bilevel programming
- Convergences for robust bilevel polynomial programmes with applications
- Solving quadratic convex bilevel programming problems using a smoothing method
- Partially smoothing and gradient-based algorithm for optimizing the VMI system with competitive retailers under random demands
- Global resolution of the support vector machine regression parameters selection problem with LPCC
This page was built for publication: Global optimization of nonlinear bilevel programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942317)
