☰

如何处理很长的公式

tag-icon • tag-icon math-mode formatting equations width
如何处理很长的公式

我有一个很长的公式，页面放不下。我该怎么办？

以下是代码：

\listfiles
\documentclass[oneside,12pt]{scrartcl}
\usepackage[ngerman]{babel}
%\usepackage{amsmath}
\usepackage[fixamsmath,disallowspaces]{mathtools}
\begin{document}
\noindent
\underline{Unterbrechbare Ger{\"a}te} \\
 $\rightarrow$ \text{ mit n verschiedenen Phasen (n beliebig aber fest)} 



\begin{equation*}
P_{j_k}(t) = \begin{cases}
    Q_{j,Standby_{init}} & \text{f"ur  } t < r_j   \\
        Q_{j,Run_k} & \text{f"ur  } 
        r_j + \sum \limits_{i=1}^k s_{j,i} + \sum \limits_{i=1}^{k-1} p_{j,i} + (k-1) * p_{j,min} + (k-1) * p_{j,non}
        \leq t <
        r_j + \sum \limits_{i=1}^k s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non} \\
        Q_{j,Standby_k} & \text{f"ur  } 
        r_j + \sum \limits_{i=1}^k s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non} 
        \leq t <
        r_j + \sum \limits_{i=1}^{k+1} s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + k * p_{j,non} \\
  \end{cases} \\
 \end{equation*}


\end{document}

结果

答案1

那怎么样？我使用了alignedand medsize(来自nccmath) 环境。我还加载了 lmodern，它是T1-encoded 并且带有重音字母，以便正确连字。此外，您可以直接排版重音字母（ä而不是 {\"a}）。

\listfiles
\documentclass[oneside,12pt]{scrartcl}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\usepackage[showframe]{geometry}
\usepackage[ngerman]{babel}
\usepackage[fixamsmath,disallowspaces]{mathtools}
\usepackage{nccmath}

\begin{document}

\noindent
\underline{Unterbrechbare Geräte} \\
$\rightarrow$ \text{ mit n verschiedenen Phasen (n beliebig aber fest)}

\begin{equation*}
  P_{j_k}(t) = \begin{cases}
  Q_{j,\text{Standby}_\text{init}} & \begin{medsize}\text{für } t < r_j,\end{medsize} \\[0.5ex]
  Q_{j,\text{Run}_k} & \! \begin{medsize}\begin{aligned}[t]\text{für }
  r_j + {} & ∑_{i=1}^k s_{j,i} + ∑_{i=1}^{k-1} p_{j,i} + (k-1) * p_{j,\min} + (k-1) * p_{j,\text{non}}\leq t
  \\[-1ex]
  &< r_j + ∑_{i=1}^k s_{j,i} + ∑_{i=1}^{k} p_{j,i} + k * p_{j,\min} + (k-1) * p_{j,\text{non}},
  \end{aligned}\end{medsize} \\[0.5ex]
  Q_{j,\text{Standby}_k} & \!\begin{medsize}\begin{aligned}[t]\text{für }
  r_j + {}& ∑_{i=1}^k s_{j,i} + ∑ \limits_{i=1}^{k} p_{j,i} + k * p_{j,\min} + (k-1) * p_{j,\text{non}}\leq t\\[-1ex]
  & < r_j + ∑ \limits_{i=1}^{k+1} s_{j,i} + ∑ \limits_{i=1}^{k} p_{j,i} + k * p_{j,\min} + k * p_{j,\text{non}},
  \end{aligned}\end{medsize}
  \end{cases}
\end{equation*}

\end{document}

在此处输入图片描述

答案2

也许你喜欢这个

 \listfiles
\documentclass[oneside,12pt]{scrartcl}
\usepackage[ngerman]{babel}
%\usepackage{amsmath}
\usepackage[fixamsmath,disallowspaces]{mathtools}
\begin{document}
\noindent
\underline{Unterbrechbare Ger{\"a}te} \\
 $\rightarrow$ \text{ mit n verschiedenen Phasen (n beliebig aber fest)} 



\begin{equation*}
P_{j_k}(t) = \begin{cases}
    Q_{j,Standby_{init}} & \text{f"ur  } t < r_j   \\
        Q_{j,Run_k} & 
        \begin{array}{ll}
        \text{f"ur  }r_j &+ \sum \limits_{i=1}^k s_{j,i}
         + \sum \limits_{i=1}^{k-1} p_{j,i} + (k-1) * p_{j,min} + (k-1) * p_{j,non}
        \leq t <
        r_j \\
        &+ \sum \limits_{i=1}^k s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non}
        \end{array} \\
        Q_{j,Standby_k} & 
        \begin{array}{ll}
        \text{f"ur  } &
        r_j + \sum \limits_{i=1}^k s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non} 
        \leq t <
        r_j \\
        &+ \sum \limits_{i=1}^{k+1} s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + k * p_{j,non} \end{array}\\
  \end{cases} \\
 \end{equation*}


\end{document}

或者你可以用数组来做到这一点

\listfiles
\documentclass[oneside,12pt]{scrartcl}
\usepackage[ngerman]{babel}
%\usepackage{amsmath}
\usepackage[fixamsmath,disallowspaces]{mathtools}
\begin{document}
\noindent
\underline{Unterbrechbare Ger{\"a}te} \\
 $\rightarrow$ \text{ mit n verschiedenen Phasen (n beliebig aber fest)} 



\begin{equation*}
P_{j_k}(t) = 
\left\lbrace
\begin{array}{lr@{}l}
Q_{j,Standby_{init}} & \text{f"ur  }&  t < r_j   \\
Q_{j,Run_k} & \text{f"ur  } &  r_j + \sum \limits_{i=1}^k s_{j,i}
      + \sum \limits_{i=1}^{k-1} p_{j,i} + (k-1) * p_{j,min} + (k-1) * p_{j,non}
      \leq t <  r_j \\
      && + \sum \limits_{i=1}^k s_{j,i} +\sum\limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non}\\
Q_{j,Standby_k} & \text{f"ur  }  & r_j + \sum \limits_{i=1}^k s_{j,i}
     + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + (k-1) * p_{j,non} 
     \leq t <  r_j \\
     &&+ \sum \limits_{i=1}^{k+1} s_{j,i} + \sum \limits_{i=1}^{k} p_{j,i} + k * p_{j,min} + k * p_{j,non}
\end{array}\right.
\end{equation*}
\end{document}

相关内容