Optimality conditions for optimistic bilevel programming problem using convexifactors
From MaRDI portal
Publication:415386
DOI10.1007/S10957-011-9941-0zbMATH Open1262.90137OpenAlexW2053072311MaRDI QIDQ415386FDOQ415386
Authors: Bhawna Kohli 
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
Recommendations
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality and duality results for bilevel programming problem using convexifactors
- New necessary optimality conditions in optimistic bilevel programming
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Optimization and nonsmooth analysis
- Variational Stability and Marginal Functions via Generalized Differentiation
- New necessary optimality conditions in optimistic bilevel programming
- Subgradients of marginal functions in parametric mathematical programming
- Optimality conditions for bilevel programming problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- 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
- Convexifactors, generalized convexity and vector optimization
- First-order necessary optimality conditions for general bilevel programming problems
- Convexifactors, generalized convexity, and optimality conditions
- Some properties of the bilevel programming problem
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Title not available (Why is that?)
- Necessary optimality conditions for Stackelberg problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
Cited In (21)
- Optimality conditions for pessimistic bilevel problems using convexificator
- Necessary optimality conditions for bilevel set optimization problems
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- First and second order optimality conditions using approximations for fractional multiobjective bilevel problems under fractional constraints
- Efficiency conditions for multiobjective bilevel programming problems via convexificators
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Necessary and sufficient conditions for efficiency via convexificators
- On the partial calmness condition for an interval-valued bilevel optimization problem
- 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
- Necessary optimality conditions for bilevel optimization problems using convexificators
- 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
- Optimality and duality results for bilevel programming problem using convexifactors
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- On multiobjective bilevel optimization using tangential subdifferentials
- Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- A Cutting Plane Approach for Solving Linear Bilevel Programming Problems
This page was built for publication: Optimality conditions for optimistic bilevel programming problem using convexifactors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415386)
