Global Optimization of Mixed Integer Programming Problems via Continuous Programming and Its Applications to Information Technology

点击翻译按钮获取中文摘要

Many of problems caused in developing and operating information technology are formulated into mixed integer programming problems. Those problems are rarely solved to optimality, but processed heuristically or approximated into convex programming problems, because the number of discrete variables is enormous in general. In this research, we dealt with mixed integer programming problems which can be applied to information technology, and reformulated them into equivalent continuous optimization problems. We also developed some efficient global optimization algorithms for solving the resulting problems.