如果目标函数或约束条件中包含非线性函数，就称这种规划问题为非线性规划问
题。一般说来，解非线性规划要比解线性规划问题困难得多。而且，也不象线性规划有
单纯形法这一通用方法，非线性规划目前还没有适于各种问题的一般算法，各个方法都
有自己特定的适用范围(If you include the nonlinear function of the objective function or constraints, for nonlinear programming ask we call this planning problem
Questions. Generally speaking, nonlinear programming than the linear programming problem is much more difficult. But, unlike a linear programming
The general method of simplex method for nonlinear programming, there is no general algorithm which is suitable for all kinds of problems, various methods
Has its own specific scope)