A new global optimal algorithm is presented to solve linear programming problems with nonlinear constraints.
本文提出了一种新的适用于处理非线性约束下线性规划问题的全局优化算法。
Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.
通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。
The chaotic BP algorithm is applied to nonlinear system modeling to obtain the optimal approximation in the global sense.
将混沌BP算法应用于非线性系统建模，以求获得全局意义下的最优逼近。
应用推荐