ABSTRACT
This paper establishes several new facts on generalized polyhedral convex sets and shows how they can be used in vector optimization. Among other things, a scalarization formula for the efficient solution sets of generalized linear vector optimization problems is obtained. We also prove that the efficient solution set of a generalized linear vector optimization problem in a locally convex Hausdorff topological vector space is the union of finitely many generalized polyhedral convex sets and it is connected by line segments.
Acknowledgements
The author would like to thank Professor Nguyen Dong Yen for his guidance and the anonymous referees for their very careful reading and valuable suggestions.
Notes
No potential conflict of interest was reported by the author.