Furthermore, it gives an optimum condition and a simple algorithm of the special interaction programming by changing it into a special convex quadratic bilevel programming.

并且通过把该交叉规划转化为特殊的凸二次双水平规划，给出这类交叉规划的最优性条件和求解算法。

youdao

Furthermore, it gives an optimum condition and a simple algorithm of the special interaction programming by changing it into a special convex quadratic bilevel programming.

并且通过把该交叉规划转化为特殊的凸二次双水平规划，给出这类交叉规划的最优性条件和求解算法。

youdao