An exact penalty method for weak linear bilevel programming problem

DOI10.1007/s12190-012-0620-6zbMath1295.90020OpenAlexW1983224277MaRDI QIDQ2511344

Tao Zhang, Kangtai Sun, Yue Zheng, Zhong-Ping Wan

Publication date: 5 August 2014

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-012-0620-6

zbMATH Keywords

penalty methodlinear bilevel programmingweak linear bilevel programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Linear programming (90C05)

Related Items (7)

A survey on bilevel optimization under uncertainty ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ Maximum entropy approach for solving pessimistic bilevel programming problems ⋮ Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application ⋮ A solution approach to the weak linear bilevel programming problems ⋮ Methods for Pessimistic Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical bilevel optimization. Algorithms and applications
• A penalty function approach for solving bi-level linear programs
• Bilevel and multilevel programming: A bibliography review
• A note on a penalty function approach for solving bilevel linear programs
• A symmetrical linear maxmin approach to disjoint bilinear programming
• A partial cooperation model for non-unique linear two-level decision problems
• Foundations of bilevel programming
• Weak linear bilevel programming problems: existence of solutions via a penalty method
• Weak via strong Stackelberg problem: New results
• Topological existence and stability for Stackelberg problems
• An overview of bilevel optimization
• Existence of solutions to weak nonlinear bilevel problemsviaMinSup and d.c. problems
• A cutting plane algorithm for solving bilinear programs
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Necessary optimality conditions in pessimistic bilevel programming
• Convex Analysis
• A solution method for the linear static Stackelberg problem using penalty functions
• Concavity cuts for disjoint bilinear programming

This page was built for publication: An exact penalty method for weak linear bilevel programming problem