An objective penalty function of bilevel programming
From MaRDI portal
Publication:430961
DOI10.1007/s10957-011-9945-9zbMath1259.90138OpenAlexW1988507758MaRDI QIDQ430961
Ming Jiang, Chuangyin Dang, Zhiqing Meng, Rui Shen
Publication date: 26 June 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9945-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
An objective penalty method for optimistic bilevel programming problems ⋮ An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions ⋮ A quadratic objective penalty function for bilevel programming ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Connections between single-level and bilevel multiobjective optimization
- Bilevel programming: a survey
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Optimal co-investment in supply chain infrastructure
- An exact penalty on bilevel programs with linear vector optimization lower level
- A game theoretic perspective to flow control in telecommunication networks
- Foundations of bilevel programming
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- Manufacturer's revenue-sharing contract and retail competition
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- A Bilevel Programming Method for Pipe Network Optimization
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Exact penalty functions for convex bilevel programming problems.
This page was built for publication: An objective penalty function of bilevel programming
