Vector optimization is a subarea of mathematical optimization where optimization problems with a vector-valued objective functions are optimized with respect to a given partial ordering and subject to certain constraints. A multi-objective optimization problem is a special case of a vector optimization problem: The objective space is the finite dimensional Euclidean space partially ordered by the component-wise "less than or equal to" ordering.
In mathematical terms, a vector optimization problem can be written as:
C\operatorname{-}minxf(x)
f:X\toZ
Z
C\subseteqZ
X
S\subseteqX
There are different minimality notions, among them:
\bar{x}\inS
x\inS
f(x)-f(\bar{x})\not\in-\operatorname{int}C
\bar{x}\inS
x\inS
f(x)-f(\bar{x})\not\in-C\backslash\{0\}
\bar{x}\inS
\bar{x}
\tilde{C}
C\backslash\{0\}\subseteq\operatorname{int}\tilde{C}
Every proper minimizer is a minimizer. And every minimizer is a weak minimizer.[1]
Modern solution concepts not only consists of minimality notions but also take into account infimum attainment.[2]
Any multi-objective optimization problem can be written as
d | |
R | |
+\operatorname{-}min |
xf(x)
f:X\toRd
d | |
R | |
+ |
Rd