Abstract.
This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ m being the underlying ordering cone, called semistrictly ( m\ −int P)-quasiconvex functions. This notion allows us to unify various results on existence of weakly efficient (weakly Pareto) optima. By imposing a coercivity condition we establish also the compactness of the set of weakly Pareto solutions. In addition, we provide various characterizations for the non-emptiness, convexity and compactness of the solution set for a subclass of quasiconvex vector optimization problems on the real-line. Finally, it is also introduced the notion of explicit ( m\ −int P)-quasiconvexity (equivalently explicit (int P)-quasiconvexity) which plays the role of explicit quasiconvexity (quasiconvexity and semistrict quasiconvexity) of real-valued functions.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Acknowldegements. The author wishes to thank both referees for their careful reading of the paper, their comments, remarks, helped to improve the presentation of some results. One of the referee provided the references [5, 6] and indirectly [20].
Rights and permissions
About this article
Cite this article
Flores-Bazán, F. Semistrictly quasiconvex mappings and non-convex vector optimization. Math Meth Oper Res 59, 129–145 (2004). https://doi.org/10.1007/s001860300321
Issue Date:
DOI: https://doi.org/10.1007/s001860300321