Lower Bound Methods for 0-1 Linear Constrained Quadratic Programming

摘要：

Some lower bound methods for 0-1 linear constrained quadratic programming problem are discussed in this paper. Several different dual methods and their relationsliip are analyzed, and a necessary and sufficient condition for zero duality gap is proposed.

关键词： Canonical Duality Lower Bound Integer Programming

作者: Cheng Lu Zhenbo Wang Wenxun Xing

作者单位: Department of Mathematical Sciences, Tsinghua University, Beijing, 100084

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 886-893

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）