... | ... | @@ -36,11 +36,11 @@ multi-objective optimization problem has the form |
|
|
[latexmath]
|
|
|
++++
|
|
|
\begin{aligned}
|
|
|
\text{ min} \quad & \quad f_m({\bf x}), ~& m &= \{1, \ldots, M\} \\
|
|
|
\text{s.t.} \quad & \quad g_j({\bf x}) \geq 0, & j &= \{1, \ldots, J\}
|
|
|
\mathrm{ min} \quad & \quad f_m({\bf x}), ~& m &= \{1, \ldots, M\} \\
|
|
|
\mathrm{s.t.} \quad & \quad g_j({\bf x}) \geq 0, & j &= \{1, \ldots, J\}
|
|
|
\\
|
|
|
\quad & \quad -\infty \leq x_i^L \leq {\bf x}=x_i \leq x_i^U \leq \infty,& i &= \{0, \ldots, n \}
|
|
|
\text{.}\end{aligned}
|
|
|
.\end{aligned}
|
|
|
++++
|
|
|
|
|
|
The latexmath:[M]
|
... | ... | |