Generalized convexity in vector optimization

From MaRDI portal





This chapter surveys recent developments in vector optimization. It focuses on notions of generalized convexity (pseudoconvexity, quasiconvexity, invexity) for functions with values in an order topological vector space, and provides optimality conditions for the corresponding programs. Scalarization techniques on multicriteria (Pareto) optimization problems and density results of Arrow-Barankin-Blackwell type are also discussed. For the entire collection see [Zbl 1070.26002].




Cited in
(30)








This page was built for publication: Generalized convexity in vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703512)