...)满足条件,将(1)式分数规划问题(fractional programming problem)转换成较容易处理的线性规划问题 (linear programming problem):
基于357个网页-相关网页
dual linear programming problem 对偶线性规划问题
integer linear programming problem 整数线性规划问题
solving linear programming problem 解线性规划问题
relaxed linear programming problem 松驰问题
inverse linear programming problem 线性规划逆问题
particular linear programming problem 特殊的线性规划问题
decomposed linear programming problem 可分解的线性规划问题
feasibility of linear programming problem 线性规划问题的可行解区域
standard linear programming problem 标准线性规划 ; 标准线性规划问题
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
It's a typical large-scale non-linear programming problem.
它是典型的大型多约束非线性规划问题。
应用推荐