Optimality and duality in vector optimization involving generalized type I functions over cones
From MaRDI portal
(Redirected from Publication:620517)
Recommendations
- Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones
- Optimality and duality for vector optimization under generalized type-I univexity
- Sufficiency and duality for a nonsmooth vector optimization problem with generalized \(alpha\)-\(d_{I}\)-type-I univexity over cones
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- Unified duality for vector optimization problem over cones involving support functions
Cites work
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- Generalized invexity for nonsmooth vector-valued mappings
- Generalized nonsmooth invexity over cones in vector optimization
- Invex functions and constrained local minima
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
- Necessary and sufficient conditions in constrained optimization
- Nondifferentiable optimization by smooth approximations
- On locally Lipschitz vector-valued invex functions
- On sufficiency of the Kuhn-Tucker conditions
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
- Optimality and duality theorems for non smooth multiobjective fractional programs
- Optimality criteria in mathematical programming involving generalized invexity
- Optimality criteria in nonlinear programming involving nonconvex functions
- Optimization and nonsmooth analysis
- Saddle-point criteria in an -approximation method for nonlinear mathematical programming problems involving invex functions
- Sufficiency in nonsmooth multiobjective programming involving generalized ( F, )-convexity
- Sufficient optimality conditions and duality for a quasiconvex programming problem
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
Cited in
(12)- Generalized connected functions with respect to cones
- Generalized higher-order cone-convex functions and higher-order duality in vector optimization
- Vector optimization with generalized cone locally connected functions
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Vector optimization with cone constraints under generalized type I univexity in Banach spaces
- Unified duality for vector optimization problem over cones involving support functions
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- An image space analysis approach for nonsmooth multiobjective programming problems under data uncertainty
This page was built for publication: Optimality and duality in vector optimization involving generalized type I functions over cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620517)