Semistrictly quasiconvex mappings and non-convex vector optimization |
| |
Authors: | Email author" target="_blank">Fabián?Flores-BazánEmail author |
| |
Institution: | (1) Departamento de Ingeniería Matemática, Universidad de Concepción, Casilla, 160-C, Concepción – Chile |
| |
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.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]. |
| |
Keywords: | Non-convex vector functions Weakly efficient solution Vector optimization Multiobjective programming Asymptotic cone |
本文献已被 SpringerLink 等数据库收录! |
|