Generalized convexity and vector optimization

DOI10.1007/978-3-540-85671-9zbMath1162.49001OpenAlexW590002453MaRDI QIDQ951139

Kin Keung Lai, Shashi Kant Mishra, Shou-Yang Wang

Publication date: 30 October 2008

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85671-9

zbMATH Keywords

vector optimizationgeneralized convexityoptimality conditionsduality theorygeneralized convex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Axiomatic and generalized convexity (52A01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convexity of real functions of several variables, generalizations (26B25) Mathematical programming (90Cxx) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items

On sufficient optimality conditions for multiobjective control problems, Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency, New optimality conditions for a nondifferentiable fractional semipreinvex programming problem, On duality for mathematical programs with vanishing constraints, Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators, New optimality conditions for nonsmooth control problems, On e-convex functions and e-subdifferentials in locally convex spaces, On approximately star-shaped functions and approximate vector variational inequalities, A review of deterministic optimization methods in engineering and management, On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials, The modified objective function method for univex multiobjective variational problems, Pseudoconvexity properties of average cost functions, Roughly \(B\)-invex programming problems, Characterizations of efficient and weakly efficient points in nonconvex vector optimization