non-linear programming problem

基本解释

This scheme changed a non-linear programming problem to a linear one, made it possible for structure dynamic optimization design.
该方法将非线性规划问题转化成线性规划问题，使结构动力最优化设计成为可能。
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方法）是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
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.
通过变量代换将问题中的两种耦合关系分解开，使得该问题转化为一个含有复杂约束条件的非线性规划问题。