First-order necessary optimality conditions for general bilevel programming problems

DOI10.1007/BF02192648zbMath0866.90119MaRDI QIDQ5921628

A. Yezza

Publication date: 4 August 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersnonsmooth analysisvalue functionsnecessary conditions of optimalitygeneral bilevel programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (10)

Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ Deriving the properties of linear bilevel programming via a penalty function approach ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ A novel approach to bilevel nonlinear programming ⋮ An overview of bilevel optimization ⋮ First-order necessary optimality conditions for general bilevel programming problems ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work

• Unnamed Item
• On the structure and properties of a linear multilevel programming problem
• Relaxed optimal control problems governed by integral equations
• Optimality conditions for the bilevel programming problem
• Optimization and nonsmooth analysis
• A note on the optimality conditions for the bilevel programming problem

This page was built for publication: First-order necessary optimality conditions for general bilevel programming problems