The proposed non-convex problem is approximated as a mix binary integer programming problem and solved by branch and bound algorithm with low complexity. 采用确定性变换将提出的非凸优化问题近似为混合二进制整数规划(BIP)问题,并采用低复杂度的分支界定算法求解。
The optimal turned out slab pile ( TOSP ) problem in the slab yard of iron & steel industry is formulated as a binary integer programming model in this paper. 对钢铁企业板坯库中的最优倒垛问题建立了0和1整数规划模型。
With mathematical modeling method, a mathematical optimization problem is transformed from original communication problem. We show that this problem is formulated as a mixed binary integer programming problem, which is hard to find the global optimum in terms of computational complexity. 利用合理的数学建模将上述复杂的通信问题转化为一个最优化问题,其理论上是一个非线性混合二进制整数规划(BIP)问题,求解最优解的时间复杂度较高。