A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
From MaRDI portal
Publication:280097
DOI10.1007/s10898-015-0341-0zbMath1345.90070OpenAlexW982066950MaRDI QIDQ280097
Semu Mitiku Kassa, Abay Molla Kassa
Publication date: 29 April 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0341-0
Numerical mathematical programming methods (65K05) Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items (9)
Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ Three-level global resource allocation model for HIV control: a hierarchical decision system approach ⋮ On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory ⋮ Unnamed Item ⋮ Existence and computations of best affine strategies for multilevel reverse Stackelberg games ⋮ Multilevel multi-leader multiple-follower games with nonseparable objectives and shared constraints ⋮ Multilevel reverse Stackelberg differential games: existence and solution approach for affine strategies ⋮ A relaxation solving approach for the linear trilevel programming problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Introduction to sensitivity and stability analysis in nonlinear programming
- An extended branch and bound algorithm for linear bilevel programming
- Jointly constrained bilinear programs and related problems: An overview
- A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
- Bilevel and multilevel programming: A bibliography review
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Parametric global optimisation for bilevel programming
- Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
- Feasible direction method for bilevel programming problem
- A multi-parametric programming algorithm for special classes of non-convex multilevel optimization problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Sensitivity analysis for nonlinear programming using penalty methods
- An algorithm for the solution of multiparametric mixed integer linear programming problems
- Global optimization of nonlinear bilevel programming problems
This page was built for publication: A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
