Generalized nonsmooth invexity over cones in vector optimization
From MaRDI portal
Publication:2462104
DOI10.1016/j.ejor.2007.01.047zbMath1175.90365MaRDI QIDQ2462104
Publication date: 23 November 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.047
duality; optimality; cones; vector optimization problem; nonsmooth pseudo-invexity; nonsmooth quasi-invexity
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Nonsmooth multiobjective optimization problems and weak vector quasi-variational inequalities, Optimality conditions for a class of composite multiobjective nonsmooth optimization problems, Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization, Optimality and duality in vector optimization involving generalized type I functions over cones, A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality, Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity, On a nonsmooth vector optimization problem with generalized cone invexity, Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming, Modified objective function method in nonsmooth vector optimization over cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality criteria in nonlinear programming involving nonconvex functions
- Sufficient optimality conditions and duality for a quasiconvex programming problem
- On sufficiency of the Kuhn-Tucker conditions
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
- Invex functions and constrained local minima
- Generalized invexity for nonsmooth vector-valued mappings
- On locally Lipschitz vector-valued invex functions