non-linear programming problem

基本解釋

This scheme changed a non-linear programming problem to a linear one, made it possible for structure dynamic optimization design.
該方法將非線性規(guī)劃問題轉(zhuǎn)化成線性規(guī)劃問題，使結(jié)構(gòu)動(dòng)力最優(yōu)化設(shè)計(jì)成為可能。
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.
轉(zhuǎn)軸直徑搜索可行方向法（DSFD方法）是一種比較有效的求解有約束非線性規(guī)劃問題的算法，但它只能得到局部最優(yōu)解。
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.
通過變量代換將問題中的兩種耦合關(guān)系分解開，使得該問題轉(zhuǎn)化為一個(gè)含有復(fù)雜約束條件的非線性規(guī)劃問題。