多目标过程优化综合问题为多目标混合整数非线性规划模型的求解。
This question almost solves the model of Multi-objectives Mix-integer Nonlinear Programming (MOMINLP).
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
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.
该模型基于混合整数线性规划模型，以供应网络内总生产成本和物流成本最小化作为目标函数，并应用标准优化软件求解。
Minimizing total production and logistic costs within the supply network was considered as the objective function. This modified model can be solved using standard optimization software.
该模型基于混合整数线性规划模型，以供应网络内总生产成本和物流成本最小化作为目标函数，并应用标准优化软件求解。
Minimizing total production and logistic costs within the supply network was considered as the objective function. This modified model can be solved using standard optimization software.
应用推荐