non-linear programming problem 非线性规划问题
gray non linear programming problem 灰色非线性规划问题
unconstrained non-linear programming problem 无约束非线性规划问题
The two different kinds of combined relations in this problem are de-coupled by variable replacing, and the problem is changed into a non-linear programming problem with complex constraints.
通过变量代换将问题中的两种耦合关系分解开，使得该问题转化为一个含有复杂约束条件的非线性规划问题。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
应用推荐