最近在CSDN记录自己的一些研究过程,本篇记录一些Latex排版优化问题的做法。
latex 写优化问题的一种排版
原问题
其中涉及到的代码:(我把align*改成了aligned,实测不改也行)
\begin{aligned}
\text{Minimize} \quad & f(x) \\
\text{subject to} \quad & g_i(x) \leq 0, \quad i = 1,2,\ldots,m \\
& h_j(x) = 0, \quad j = 1,2, \ldots, p
\end{aligned}
显示效果:
Minimize
f
(
x
)
subject to
g
i
(
x
)
≤
0
,
i
=
1
,
2
,
…
,
m
h
j
(
x
)
=
0
,
j
=
1
,
2
,
…
,
p
\begin{align*} \text{Minimize} \quad & f(x) \\ \text{subject to} \quad & g_i(x) \leq 0, \quad i = 1,2,\ldots,m \\ & h_j(x) = 0, \quad j = 1,2, \ldots, p \end{align*}
Minimizesubject tof(x)gi(x)≤0,i=1,2,…,mhj(x)=0,j=1,2,…,p
案例
Minimize ∑ i ∈ S B ∩ { 0 } g i ( x i ) subject to ∑ i ∈ S B ∩ { 0 } ψ i ( x i ) ≤ 0 ∑ i ∈ S B ∩ { 0 } A i ( x i ) = 0 x i ∈ X i i ∈ { 0 } ∩ S B \begin{align*} \text{Minimize} \quad &\sum_{i\in S^B \cap\{0\}}g_i(x_i) \\ \text{subject to} \quad & \sum_{i\in S^B \cap\{0\}} \psi_i({x_i})\leq0\\ & \sum_{i\in S^B \cap\{0\}} A_i({x_i})=0\\ & x_i\in\Chi_i\quad i\in\{0\}\cap S^B \end{align*} Minimizesubject toi∈SB∩{0}∑gi(xi)i∈SB∩{0}∑ψi(xi)≤0i∈SB∩{0}∑Ai(xi)=0xi∈Xii∈{0}∩SB
代码块
\begin{align*}
\text{Minimize} \quad &\sum_{i\in S^B \cap\{0\}}g_i(x_i) \\
\text{subject to} \quad & \sum_{i\in S^B \cap\{0\}} \psi_i({x_i})\leq0\\
& \sum_{i\in S^B \cap\{0\}} A_i({x_i})=0\\
& x_i\in\Chi_i\quad i\in\{0\}\cap S^B
\end{align*}