On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
From MaRDI portal
(Redirected from Publication:6621087)
approximate efficient solutionconvexificatorsduality resultsinterval-valued programmingmultiobjective optimizationoptimality conditions
Nonsmooth analysis (49J52) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Recommendations
- The Karush-Kuhn-Tucker optimality conditions in interval-valued multiobjective programming problems
- On optimality and duality for approximate solutions in nonsmooth interval-valued multiobjective semi-infinite programming
- Approximate solutions of interval-valued optimization problems
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Convexificators and strong Kuhn-Tucker conditions
Cites work
- A generalized derivative for calm and stable functions
- A note on characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A study on vector variational-like inequalities using convexificators and application to its bi-level form
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Convexifactors, generalized convexity and vector optimization
- Convexificators and necessary conditions for efficiency
- Convexificators and strong Kuhn-Tucker conditions
- Decision making theories and methods based on interval-valued intuitionistic fuzzy sets
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- 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
- Duality theory for optimization problems with interval-valued objective functions
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 6520257 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Models and methods for interval-valued cooperative games in economic management
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- Necessary and sufficient conditions for efficiency via convexificators
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- New efficiency conditions for multiobjective interval-valued programming problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
- On approximate starshapedness in multiobjective optimization
- On approximately star-shaped functions and approximate vector variational inequalities
- On characterizing the blunt minimizers of epsilon convex programs
- On interval-valued nonlinear programming problems
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- On the applications of nonsmooth vector optimization problems to solve generalized vector variational inequalities using convexificators
- On vector optimization problems and vector variational inequalities using convexificators
- Optimality and duality in constrained interval-valued optimization
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints
- Optimality conditions for multiobjective fractional programming, via convexificators
- Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions
- Sufficiency and duality in non-smooth interval valued programming problems
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Cited in
(4)- On quasiconvex multiobjective optimization and variational inequalities using Greenberg-Pierskalla based generalized subdifferentials
- On multiobjective optimization problems involving higher order strong convexity using directional convexificators
- First and second order optimality conditions for nonsmooth multiobjective problems with equilibrium constraints
- On multiobjective optimization and approximate vector variational inequalities using directional convexificators
This page was built for publication: On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621087)
