布尔二次规划的基准生成器
A benchmark generator for boolean quadratic programming
School of Automation Central South University(中南大学自动化学院);School of Engineering Texas A&M University at Qatar(卡塔尔德州农工大学工程学院)
AI总结:
本文提出了一种生成布尔二次规划问题的基准生成器,通过经典拉格朗日对偶理论证明在某些条件下原问题与对偶问题之间不存在对偶空隙,并通过数值示例验证了方法的有效性。
摘要:
对于布尔二次规划(BQP),我们利用经典的拉格朗日对偶理论证明,在某些条件下原问题与对偶问题之间不存在对偶空隙。给出一个基准生成器来生成可以以多项式时间解决的一类随机BQP问题。生成了几个数值例子以展示所提出方法的有效性。
英文摘要:
For boolean quadratic programming (BQP), we will show that there is no duality gap between the primal and dual problems under some conditions by using the classical Lagrangian duality. A benchmark generator is given to create random BQP problems which can be solved in polynomial time. Several numerical examples are generated to demonstrate the effectiveness of the proposed method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。