Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions

DOI10.1080/02331939608844179zbMath0855.90112OpenAlexW2034245933MaRDI QIDQ4893697

Vasile C. Preda

Publication date: 3 February 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844179

zbMATH Keywords

necessary optimality conditionsnonsmooth optimizationduality resultsweak minimumright differentialsgeneralized semilocally convex functionsnonlinear multiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

Optimality conditions and duality in fractional programming involving semilocally preinvex and related functions ⋮ Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Optimality conditions and duality in multiobjective nonlinear programming involving semilocally b-preinvex and related functions ⋮ Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions ⋮ Necessary optimality conditions in nondifferentiable vector optimization ⋮ Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions ⋮ On nonlinear multiple objective fractional programming involving semilocally type-I univex functions ⋮ Multiple objective fractional programming involving semilocally type I-preinvex and related functions ⋮ Semilocal E-convexity and semilocal E-convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex composite multi-objective nonsmooth programming
• Equivalence of saddle-points and optima for non-concave programmes
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• Pre-invex functions in multiple objective optimization
• Duality for nonlinear multiple-criteria optimization problems
• Perfect duality for convexlike programs
• Duality theory for maximizations with respect to cones
• Generalizations of convex and related functions
• Duality theory in multiobjective programming
• Proper efficiency and the theory of vector maximization
• Vector maximisation and lagrange multipliers
• Convexlike alternative theorems and mathematical programming
• Some results on dual vector optimization problems
• What is invexity?
• Generalised convexity and duality in multiple objective programming
• Duality in nonlinear programming involving semilocally convex and related functions
• A duality theorem for non-linear programming
• Strong Vector Minimization and Duality
• Composite Nonsmooth Programming with Gâteaux Differentiability
• On generalised convex mathematical programming
• Generalization of some duality theorems in nonlinear programming
• Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory

This page was built for publication: Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions