Connections among constrained continuous and combinatorial vector optimizationy

N. J. Huang, X. X. Huang, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


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.
Original languageEnglish
Pages (from-to)15-27
Number of pages13
Issue number1-2
Publication statusPublished - 1 Jan 2011


  • Constrained vector optimization
  • Continuous vector optimization
  • Integer vector optimization
  • Optimality condition
  • Penalized vector optimization

ASJC Scopus subject areas

  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'Connections among constrained continuous and combinatorial vector optimizationy'. Together they form a unique fingerprint.

Cite this