Optimality and duality results for bilevel programming problem using convexifactors
From MaRDI portal
Publication:637559
DOI10.1007/S10957-011-9819-1zbMATH Open1229.90207OpenAlexW2072061819MaRDI QIDQ637559FDOQ637559
Authors: 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
Recommendations
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Variational inequalities and optimistic bilevel programming problem via convexifactors
- Necessary optimality conditions for bilevel optimization problems using convexificators
Cites Work
- Foundations of bilevel programming
- Optimality 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
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- On the regularity condition for vector programming problems
- 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
- Problems of Hierarchical Optimization in Finite Dimensions
Cited In (27)
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- Optimality conditions for pessimistic bilevel problems using convexificator
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Efficiency conditions for multiobjective bilevel programming problems via convexificators
- On interval-valued bilevel optimization problems using upper convexificators
- Title not available (Why is that?)
- Variational inequalities and optimistic bilevel programming problem via convexifactors
- Title not available (Why is that?)
- An evolutionary algorithm for solving bilevel programming problems using duality conditions
- Necessary and sufficient conditions for efficiency via convexificators
- Necessary optimality conditions for a bilevel multiobjective programming problem via a \(\Psi\)-reformulation
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
- A cutting plane approach for solving linear bilevel programming problems
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- On sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
This page was built for publication: Optimality and duality results for bilevel programming problem using convexifactors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637559)
