混合整数二次规划在NP中的应用
Mixed-integer Quadratic Programming is in NP
摘要:
混合整数二次规划(英语:Mixed-integer quadratic programming)是一个在多面体集合中的点上优化二次函数的问题,其中一些分量被限制为整数。本文证明了混合整数二次规划的决策版本是NP的,从而说明它是NP-完全的。这是通过证明如果混合整数二次规划的决策版本是可行的,则存在多项式大小的解决方案来建立的。这一结果推广和统一了二次规划和整数线性规划的经典结果。
英文摘要:
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-integer quadratic programming is feasible, then there exists a solution of polynomial size. This result generalizes and unifies classical results that quadratic programming is in NP and integer linear programming is in NP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。