我想写下这个推论。它包含两个不等式,如下面的屏幕截图所示。我IEEEtran
在 overleaf 中使用两列文档类——目前使用 TeX Live 2022。
举例来说,尽管方程 (1) 和 (2) 看起来不太简洁,但预期结果却与此类似。
\documentclass[journal]{IEEEtran}
\usepackage{mathtools}
\usepackage{amsmath}
\begin{document}
\begin{corollary}\label{Corollary:new_seq}
Supposing that $i^{\ast} = argmax_i R_3(i)$ and $i^{\ast\ast} = argmax_i R_4(i)$ for all $i=1,\ldots,n$, if $max (R_3(i),R_4(i)) \geq max(R_5(A^{\prime}),R_6(A^{\prime\prime}))$ in a serial configuration, then the new sequence is optimal when one of the following constraints is fulfilled.
\renewcommand{\labelenumi}{(\roman{enumi})}
\begin{enumerate}
\item
\begin{equation} \label{eq:corollary_i}
max_{i^{\ast} =1,...,n} (q_i^{\ast}\cdot p_i^{\ast} + (1-q_i^{\ast})c_i^{\ast} \quad \forall i^{\ast}\geq(n-1), q_i^{\ast}\cdot c_i^{\ast} + (1-q_i^{\ast})p_i^{\ast} \quad \text{for $i^{\ast} = n$}) \geq (n-1)w + nv
\end{equation}
\item
\begin{equation} \label{eq:corollary_ii}
max_{i^{\ast\ast} =1,...,n} (q_i^{\ast\ast}\cdot p_i^{\ast\ast} + (1-q_i^{\ast\ast})c_i^{\ast\ast} \quad \forall i^{\ast\ast}\geq(n-1), q_i^{\ast\ast}\cdot c_i^{\ast\ast} + (1-q_i^{\ast\ast})p_i^{\ast\ast} \quad \text{for $i^{\ast} = n$}) \geq (n+1)w + (n+2)v
\end{equation}
\end{enumerate}
\end{corollary}
\end{document}
但是,公式 (i) 和 (ii) 均超出了下列范围。
有人能建议如何处理代码吗?如果您有其他选择可以使代码写得更简洁,请告诉我。提前谢谢您。
答案1
我不会同时用枚举标签和方程标签来标记不等式。既然无论如何你都需要枚举标签,那么我会放弃方程标签。在下面的代码中,我设置了枚举,以便可以轻松地交叉引用项目。
\documentclass[journal]{IEEEtran}
\usepackage{mathtools}
%\usepackage{amsmath} % amsmath is loaded automatically by mathtools
\DeclareMathOperator{\argmax}{argmax}
\usepackage{amsthm}
\newtheorem{corollary}{Corollary}
\usepackage{newtxmath}
\usepackage{enumitem}
\begin{document}
\begin{corollary}\label{Corollary:new_seq}
Suppose that $i^{\ast} = \argmax_i R_3(i)$ and
$i^{\ast\ast} = \argmax_i R_4(i)$ for $i\in\{1,\dots,n\}$.
If $\max (R_3(i),R_4(i)) \geq \max(R_5(A'),R_6(A''))$
in a serial configuration, then the new sequence is
optimal if one of the following constraints is
ful\-filled.
\begin{enumerate}[label=\textup{C.\roman*)},
ref= C.\roman*,
left=0pt, align=left]
\item \label{item:corollary_i}
\parbox[t]{0.8\columnwidth}{\raggedright$
\max\limits_{i^{\ast} =1,\dots,n}
\bigl\{
q_i^{\ast} p_i^{\ast} + (1-q_i^{\ast})c_i^{\ast}
\textup{ for all $i^{\ast}\leq n-1$},\allowbreak
q_i^{\ast} c_i^{\ast} + (1-q_i^{\ast})p_i^{\ast}
\textup{ for $i^{\ast} = n$}
\bigr\}
\geq (n-1)w + nv$}
\bigskip
\item \label{item:corollary_ii}
\parbox[t]{0.87\columnwidth}{\raggedright$
\max\limits_{i^{\ast\ast} =1,\dots,n}
\bigl\{
q_i^{\ast\ast} p_i^{\ast\ast} + (1-q_i^{\ast\ast}) c_i^{\ast\ast}
\textup{ for all $i^{\ast\ast}\leq n-1$},\allowbreak
q_i^{\ast\ast} c_i^{\ast\ast} + (1-q_i^{\ast\ast})p_i^{\ast\ast}
\textup{ for $i^{\ast} = n$}
\bigr\}
\geq (n+1)w + (n+2)v$}
\end{enumerate}
\end{corollary}
If one of the constraints \ref{item:corollary_i} or
\ref{item:corollary_ii} is fulfilled, \dots
\end{document}