An objective penalty method for optimistic bilevel programming problems

DOI10.1007/S40305-018-0205-7MaRDI QIDQ2176835zbMATH OpenOpenAlexWikidataFDO

Authors Tao Zhang, Yu-Xin Fan, Bing Han, Yue Zheng, Jun-e Liu

Publication date 5 May 2020

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-018-0205-7

zbMATH Keywords

bilevel programmingobjective penalty methodoptimistic formulationpenalty method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• An objective penalty function of bilevel programming
• Linear bilevel multiobjective optimization problem: penalty approach
• An objective penalty function method for a class of nonlinear bilevel programming problems
• A smoothing objective penalty function algorithm for bilevel programming problems
• A penalty function method for solving a class of weak linear bilevel multi-objective programming problems

Cites work

• A Boolean penalty method for zero-one nonlinear programming
• A note on a penalty function approach for solving bilevel linear programs
• A novel penalty function method for semivectorial bilevel programming problem
• A penalty function algorithm with objective parameters for nonlinear mathematical programming
• A penalty function approach for solving bi-level linear programs
• A quadratic objective penalty function for bilevel programming
• A smoothing objective penalty function algorithm for inequality constrained optimization problems
• An Exact Penalization Viewpoint of Constrained Optimization
• An exact penalty on bilevel programs with linear vector optimization lower level
• An objective penalty function method for nonlinear programming.
• An objective penalty function of bilevel programming
• An overview of bilevel optimization
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Exact and inexact penalty methods for the generalized bilevel programming problem
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Exact penalty functions for convex bilevel programming problems.
• Exactness and algorithm of an objective penalty function
• Foundations of bilevel programming
• Handbook of test problems in local and global optimization
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Multi-level decision making. Models, methods and applications
• Multilevel decision-making: a survey
• Practical bilevel optimization. Algorithms and applications
• Semivectorial bilevel optimization problem: penalty approach

Cited in

(9)

• Double penalty method for bilevel optimization problems
• Feasible direction method for bilevel programming problem
• A smoothing objective penalty function algorithm for bilevel programming problems
• An objective penalty function of bilevel programming
• An objective penalty function method for a class of nonlinear bilevel programming problems
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results
• A penalty function method for solving ill-posed bilevel programming problem via weighted summation
• A penalty function method for solving inverse optimal value problem

This page was built for publication: An objective penalty method for optimistic bilevel programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176835)