A smoothing method for solving bilevel multiobjective programming problems

DOI10.1007/S40305-014-0059-6MaRDI QIDQ489158zbMATHOpenAlexFDO

Authors Yibing Lü, Zhongping Wan

Publication date 27 January 2015

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-014-0059-6

zbMATH Keywords

stationary pointconstraint qualificationsmoothing methodbilevel multiobjective programming

Mathematics Subject Classification ID

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

Recommendations

• A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
• A smoothing objective penalty function algorithm for bilevel programming problems
• Solving quadratic convex bilevel programming problems using a smoothing method
• A penalty function method for solving a class of weak linear bilevel multi-objective programming problems
• An objective penalty function algorithm for bilevel programming based on multi-parameters

Cites work

• scientific article; zbMATH DE number 1424524 (Why is no real title available?)
• A bi-level non-linear multi-objective decision making under fuzziness.
• A multi-level nonlinear multi-objective decision-making under fuzziness
• A smoothing method for mathematical programs with equilibrium constraints
• A solution method for semivectorial bilevel programming problem via penalty method
• An overview of bilevel optimization
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Bilevel and multilevel programming: A bibliography review
• Foundations of bilevel programming
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• Interactive bilevel multi-objective decision making
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Model and interactive algorithm of bi-level multi-objective decision-making with multiple interconnected decision makers
• Multiobjective bilevel optimization
• Necessary optimality conditions for multiobjective bilevel programs
• New optimality conditions for the semivectorial bilevel optimization problem
• Practical bilevel optimization. Algorithms and applications
• Semivectorial bilevel optimization problem: penalty approach
• Some Noninterior Continuation Methods for Linear Complementarity Problems

Cited in

(11)

• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
• A new method for solving multiobjective bilevel programs
• Solving quadratic convex bilevel programming problems using a smoothing method
• Methods for Multiobjective Bilevel Optimization
• A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
• Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation
• Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations
• scientific article; zbMATH DE number 3941279 (Why is no real title available?)
• Sufficient optimality conditions for a bilevel semivectorial D.C. problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions

This page was built for publication: A smoothing method for solving bilevel multiobjective programming problems

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