... | ... | @@ -30,15 +30,17 @@ optimization problems consist of a solution vector and optionally a |
|
|
number of equality and inequality constraints. Formally, a general
|
|
|
multi-objective optimization problem has the form
|
|
|
|
|
|
[[eq:moop:obj]]
|
|
|
[[eq:moop:constr]]
|
|
|
[[eq:moop:dvar]]
|
|
|
[latexmath]
|
|
|
++++
|
|
|
\begin{aligned}
|
|
|
\text{ min} \quad & \quad f_m({\bf x}), ~& m &= \{1, \dots, M\} \label{eq:moop:obj}\\
|
|
|
\text{ min} \quad & \quad f_m({\bf x}), ~& m &= \{1, \dots, M\} \\
|
|
|
\text{s.t.} \quad & \quad g_j({\bf x}) \geq 0, & j &= \{1, \dots, J\}
|
|
|
\\
|
|
|
\quad & \quad -\infty \leq x_i^L \leq {\bf x}=x_i \leq x_i^U \leq \infty,& i &= \{0, \dots, n \}
|
|
|
\label{eq:moop:dvar} \text{.}\end{aligned}
|
|
|
\text{.}\end{aligned}
|
|
|
++++
|
|
|
|
|
|
The latexmath:[M]
|
... | ... | |