Generalized convexity and vector optimization

DOI10.1007/978-3-540-85671-9zbMath1162.49001MaRDI 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 optimization; generalized convexity; optimality conditions; duality theory; generalized convex functions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming

52A01: Axiomatic and generalized convexity

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

26B25: Convexity of real functions of several variables, generalizations

90Cxx: Mathematical programming

49-02: Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control

Related Items

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