含乘积项非线性转线性规划

Based on the above inequality, we compute \(w_0, w_1, ..., w_N\) as follows:

\begin{align} &\min \mu\\text{Such that: }& w_0U_{ij}+w_jZ_i+w_iZ_j\leq \mu Bx_{ij},\text{ for any }i,j=1,2,...,N \nonumber\&\sum_{i=0}^N w_i=1\nonumber\& w_i\geq 0, i=0, 1, 2,...,N\nonumber \end{align}

Next, we discuss how to perform ToE under Revised WCMP routing.
\begin{eqnarray}\label{rwcmp_toe}
&\max \alpha\
\text{Such that: }& w_0U_{ij}+w_jZ_i+w_iZ_j\leq Bx_{ij},\text{ for any }i,j=1,2,...,N \nonumber\
&\sum_{i=0}^N w_i=\alpha\nonumber\
& w_i\geq 0, i=0, 1, 2,...,N\nonumber\
& X=[x_{ij}]_{N\times N}\text{ satisfies (\ref{TopologyConstraint})}\nonumber
\end{eqnarray}

含乘积项非线性转线性规划

原文：https://www.cnblogs.com/xrszff/p/13264437.html