Optimality and duality in vector optimization involving generalized type I functions over cones
From MaRDI portal
Publication:620517
DOI10.1007/s10898-009-9522-zzbMath1230.90173OpenAlexW1970442233MaRDI QIDQ620517
Seema Khurana, Meetu Bhatia, Surjeet Kaur Suneja
Publication date: 19 January 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9522-z
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
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 ⋮ Robust duality for robust efficient solutions in uncertain vector optimization problems ⋮ Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications ⋮ Vector critical points and cone efficiency in nonsmooth vector optimization
Cites Work
- Optimality criteria in nonlinear programming involving nonconvex functions
- Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- Saddle-point criteria in an \(\eta\)-approximation method for nonlinear mathematical programming problems involving invex functions
- Sufficient optimality conditions and duality for a quasiconvex programming problem
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Optimality and duality theorems for non smooth multiobjective fractional programs
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
- Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
- Generalized nonsmooth invexity over cones in vector optimization
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- Generalized invexity for nonsmooth vector-valued mappings
- On locally Lipschitz vector-valued invex functions
- INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
This page was built for publication: Optimality and duality in vector optimization involving generalized type I functions over cones
