Optimality conditions for optimistic bilevel programming problem using convexifactors
From MaRDI portal
Publication:415386
DOI10.1007/s10957-011-9941-0zbMath1262.90137OpenAlexW2053072311MaRDI QIDQ415386
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9941-0
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (16)
Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ On multiobjective bilevel optimization using tangential subdifferentials ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Convexifactors, generalized convexity, and optimality conditions
- Some properties of the bilevel programming problem
- Subgradients of marginal functions in parametric mathematical programming
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Practical bilevel optimization. Algorithms and applications
- Necessary optimality conditions for Stackelberg problems
- Hunting for a smaller convex subdifferential
- Foundations of bilevel programming
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for the bilevel programming problem
- Optimization and nonsmooth analysis
- A necessary and a sufficient optimality condition for bilevel programming problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Convexifactors, generalized convexity and vector optimization
- Optimality conditions for bilevel programming problems
- Variational Stability and Marginal Functions via Generalized Differentiation
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- New necessary optimality conditions in optimistic bilevel programming
- First-order necessary optimality conditions for general bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
This page was built for publication: Optimality conditions for optimistic bilevel programming problem using convexifactors
