☰

매우 긴 수식을 처리하는 방법

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

어떻게에 대한? 나는 aligned및 medsize(from nccmath) 환경을 사용했습니다. 또한 올바른 하이픈 연결을 위해 인코딩 lmodern되고 악센트 문자가 있는 를 로드했습니다 . T1또한 악센트 부호가 있는 문자를 직접 조판할 수도 있습니다( ä대신 {\"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}

관련 정보