Necessary Optimality Conditions for Multiobjective Bilevel Programs

DOI10.1287/moor.1100.0480zbMath1218.90180OpenAlexW2120257557MaRDI QIDQ3169136

Jane J. Ye

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/814ab69d48a7f530c450a30b75cd98575eb9da3d

zbMATH Keywords

preferencenonsmooth analysismultiobjective optimizationvalue functionconstraint qualificationnecessary optimality conditionpartial calmnessbilevel programming problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (32)

Solving linear bilevel multiobjective programming problem via exact penalty function approach ⋮ On bilevel programs with a convex lower-level problem violating Slater's constraint qualification ⋮ Feasibility problems with complementarity constraints ⋮ Solving ill-posed bilevel programs ⋮ Generic Property of the Partial Calmness Condition for Bilevel Programming Problems ⋮ Directional Necessary Optimality Conditions for Bilevel Programs ⋮ Optimality conditions for nonsmooth multiobjective bilevel optimization problems ⋮ Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem ⋮ Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ Variational analysis of marginal functions with applications to bilevel programming ⋮ Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs ⋮ A novel approach to solve multi-objective fuzzy stochastic bilevel programming using genetic algorithm ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Unnamed Item ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ Optimality conditions for vector optimization problem governed by the cone constrained generalized equations ⋮ Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints ⋮ New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective ⋮ A smoothing method for solving bilevel multiobjective programming problems ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ Global efficiency for multiobjective bilevel programming problems under generalized invexity ⋮ Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints ⋮ Necessary optimality conditions in pessimistic bilevel programming ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation ⋮ Necessary optimality condition for trilevel optimization problem ⋮ An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm ⋮ Constraint Qualifications and Optimality Conditions in Bilevel Optimization ⋮ Approximate Bilevel Optimization with Population-Based Evolutionary Algorithms ⋮ Methods for Multiobjective Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

This page was built for publication: Necessary Optimality Conditions for Multiobjective Bilevel Programs