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.
| Original language | English |
|---|---|
| Pages (from-to) | 15-27 |
| Number of pages | 13 |
| Journal | Optimization |
| Volume | 60 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 1 Jan 2011 |
Keywords
- 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
Fingerprint
Dive into the research topics of 'Connections among constrained continuous and combinatorial vector optimizationy'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver