Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearl...Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.展开更多
Under the assumption that the ordering cone has a nonempty interior and is separable (or the feasible set has a nonempty interior and is separable), we give scalarization theorems on Benson proper effciency. Applyin...Under the assumption that the ordering cone has a nonempty interior and is separable (or the feasible set has a nonempty interior and is separable), we give scalarization theorems on Benson proper effciency. Applying the results to vector optimization problems with nearly cone-subconvexlike set-valued maps, we obtain scalarization theorems and Lagrange multiplier theorems for Benson proper effcient solutions.展开更多
文摘Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.
基金Supported by the National Natural Science Foundation of China (10571035,10871141)
文摘Under the assumption that the ordering cone has a nonempty interior and is separable (or the feasible set has a nonempty interior and is separable), we give scalarization theorems on Benson proper effciency. Applying the results to vector optimization problems with nearly cone-subconvexlike set-valued maps, we obtain scalarization theorems and Lagrange multiplier theorems for Benson proper effcient solutions.