The bilinear programming is converted into a max min problem on the principle of duality, and a linear approximation algorithm for the max min problem is presented, which proves to be convergent in finite steps.

  • 利用对偶原理,将双线性规划问题转化为极大极小问题,研究了该极大极小问题的线性逼近算法,并证明了该算法在有限步内收敛。

  • 互联网摘选 2025-01-20 11:54:50

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句