Search

In this article, optimality conditions on (weak) efficient solutions in multiobjective optimization problems are investigated by using the image space analysis. A class of strong separation functions is constructed by oriented distance functions. Simultaneously, a generalized Lagrange function is introduced by the class of strong separation functions. Then, generalized Karush-Kuhn-Tucker (KKT for short) necessary optimality conditions are established without constraint qualifications or regularity conditions. Under the suitable assumptions, Lagrangian-type sufficient optimality conditions are also characterized. Moreover, the difference between strong separation and weak separation methods is explained. [ABSTRACT FROM AUTHOR]

This paper aims at employing the image space approach to investigate the conjugate duality theory for general constrained vector optimization problems. We introduce the concepts of conjugate map and subdifferential by using two types of maximums. We also construct the conjugate duality problems via a perturbation method. Moreover, the separation condition is proposed by means of vector weak separation functions. Then, it is proved to be a new sufficient condition, which ensures the strong duality theorem. This separation condition is different from the classical regular conditions in the literature. Simultaneously, the application to a nonconvex multi-objective optimization problem is shown to verify our main results. [ABSTRACT FROM AUTHOR]

In this paper, we consider a class of constrained vector optimization problems by using image space analysis. A class of vector-valued separation functions and a C-solution notion are proposed for the constrained vector optimization problems, respectively. Moreover, existence of a saddle point for the vector-valued separation function is characterized by the (regular) separation of two suitable subsets of the image space. By employing the separation function, we introduce a class of generalized vector-valued Lagrangian functions without involving any elements of the feasible set of constrained vector optimization problems. The relationships between the type-Ⅰ(Ⅱ) saddle points of the generalized Lagrangian functions and that of the function corresponding to the separation function are also established. Finally, optimality conditions for C-solutions of constrained vector optimization problems are derived by the saddle-point conditions. [ABSTRACT FROM AUTHOR]

This article focuses on a conjugate duality for a constrained vector optimization in the framework of abstract convexity. With the aid of the extension for the notion of infimum to the vector space, a set-valued topical function and the corresponding conjugate map, subdifferentials are presented. Following this, a conjugate dual problem is proposed via this conjugate map. Then, inspired by some ideas in the image space analysis, some equivalent characterizations of the zero duality gap are established by virtue of the subdifferentials. [ABSTRACT FROM AUTHOR]