Alternative theorems and optimality conditions with weakened convexity

zbMath0757.90075MaRDI QIDQ1194578

Yang, Xinmin

Publication date: 6 October 1992

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

weakened convexityoptimality conditions for vector optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ Duality and saddle-point type optimality for generalized nonlinear fractional programming. ⋮ Efficient and weak efficient points in vector optimization with generalized cone convexity ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Theorems of the alternative for multifunctions. ⋮ Duality in nondifferentiable vector programming ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities ⋮ Characterizations of the Benson proper efficiency for nonconvex vector optimization ⋮ Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity ⋮ Unnamed Item ⋮ Multiobjective fractional programming with generalized convexity