Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (Q705084): Difference between revisions

his paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set of alternatives. The generalized saddle theorem plays a key role in the proof.