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

Posted 2020-12-16 xrszff

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

egin{align} &min mu\text{Such that: }& w_0U_{ij}+w_jZ_i+w_iZ_jleq mu Bx_{ij}, ext{ for any }i,j=1,2,...,N onumber&sum_{i=0}^N w_i=1 onumber& w_igeq 0, i=0, 1, 2,...,N onumber end{align}

Next, we discuss how to perform ToE under Revised WCMP routing.
egin{eqnarray}label{rwcmp_toe}
&max alpha
ext{Such that: }& w_0U_{ij}+w_jZ_i+w_iZ_jleq Bx_{ij}, ext{ for any }i,j=1,2,...,N onumber
&sum_{i=0}^N w_i=alpha onumber
& w_igeq 0, i=0, 1, 2,...,N onumber
& X=[x_{ij}]_{N imes N} ext{ satisfies ( ef{TopologyConstraint})} onumber
end{eqnarray}