A novel approach to bilevel nonlinear programming
From MaRDI portal
Publication:2465482
DOI10.1007/s10898-006-9093-1zbMath1145.90083MaRDI QIDQ2465482
Publication date: 4 January 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9093-1
Monotonic optimization; Bilevel linear programming; Bilevel convex programming; Bilevel nonlinear programming; Branch-reduce-and-bound method; Leader and follower game; Monotonicity cuts; Polyblock approximation
65K05: Numerical mathematical programming methods
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C30: Nonlinear programming
Related Items
A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Multiobjective bilevel optimization, Global solution of bilevel programs with a nonconvex inner program, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex two-level optimization
- A global optimization approach for the linear two-level program
- Handbook of test problems in local and global optimization
- Practical bilevel optimization. Algorithms and applications
- A penalty function approach for solving bi-level linear programs
- A quasiconcave minimization method for solving linear two-level programs
- Descent approaches for quadratic bilevel programming
- Bilevel and multilevel programming: A bibliography review
- Optimization on low rank nonconvex structures
- Multilevel optimization: algorithms and applications
- On bilevel programming. I: General nonlinear cases
- Bilevel linear programming
- Monotonic Optimization: Problems and Solution Approaches
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- On two-level optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Technical Note—A Method for Solving Mathematical Programs with Nonlinear Programs in the Constraints
- Monotonic Optimization: Branch and Cut Methods
- Mathematical Programs with Optimization Problems in the Constraints
- Convex analysis and global optimization
- First-order necessary optimality conditions for general bilevel programming problems
