Optimality and duality results for bilevel programming problem using convexifactors
From MaRDI portal
Publication:637559
DOI10.1007/s10957-011-9819-1zbMath1229.90207OpenAlexW2072061819MaRDI QIDQ637559
Surjeet Kaur Suneja, Bhawna Kohli
Publication date: 6 September 2011
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-9819-1
Related Items (21)
Optimality conditions for pessimistic bilevel problems using convexificator ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ An evolutionary algorithm for solving bilevel programming problems using duality conditions ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ 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 ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators
Cites Work
- Convexifactors, generalized convexity, and optimality conditions
- Some properties of the bilevel programming problem
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Necessary optimality conditions for Stackelberg problems
- Hunting for a smaller convex subdifferential
- Foundations of bilevel programming
- On the regularity condition for vector programming problems
- 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
- Problems of Hierarchical Optimization in Finite Dimensions
- A necessary and a sufficient optimality condition for bilevel programming problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Convexifactors, generalized convexity and vector optimization
- Optimality conditions for bilevel programming problems
- 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 and duality results for bilevel programming problem using convexifactors
