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.展开更多
基金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.
