large-scale nonlinear mixed integer programming 大规模非线性混合整数规划
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
应用推荐