By utilizing an exponential variable transformation and linear underestimates of the objective and constraint functions, linear programming relaxation ( LPR) about SGP is established, and the proposed determinate global optimization algorithm is proven that can converge to the globally optimal solution of SGP.

  • 利用指数变换及对目标函数和约束函数的线性下界估计,提出一个求符号几何规划(SGP)问题全局解的确定型全局优化算法,并证明了算法的收敛性。

  • 互联网摘选 2025-01-20 13:21:45

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