Connections among constrained continuous and combinatorial vector optimization

Abstract

In this article, constrained continuous and combinatorial vector optimization problems (VOPs) are considered in the setting of finite-dimensional Euclidean spaces. Equivalence results between constrained integer and continuous VOPs are established by virtue of that between a constrained VOP and its penalized problem. Finally, one of the established equivalences is applied to derive necessary optimality conditions for a constrained integer VOP.