线性约束0-1二次规划的一个定界技术

朱文兴;张连生

系统科学与数学 ›› 1999, Vol. 19 ›› Issue (1) : 65-071.

PDF(284 KB)
PDF(284 KB)
系统科学与数学 ›› 1999, Vol. 19 ›› Issue (1) : 65-071. DOI: 10.12341/jssms09849
论文

线性约束0-1二次规划的一个定界技术

    朱文兴(1),张连生(2)
作者信息 +

A BOUNDING TECHNIQUE FOR LINEARLY CONSTRAINED 0-1 QUADRATIC PROGRAMMING

    Wen Xing ZHU(1),Lian Sheng ZHANG(2)
Author information +
文章历史 +

摘要

本文给出确定线性约束0-1二次规划问题最优值下界的方法,该方法结合McBride和Yormark的思想和总体优化中定下界的方法,证明了所定的界较McBride和Yormark的要好.求解线性约束0-1二次规划问题的分支定界算法可以利用本文的定界技术.

Abstract

Taking into account the idea of Mcbride and Yormark(1980) and a lower bounding method in global optimization, a lower bounding technique is presented in this paper for linearly constrained 0-1 quadratic programming problems, which could in turn be incorporated into the Branch-and-Bound schene. The lower bound provided is proved to be better than that of McBride and Yormark(1980).

关键词

0-1二次规划 / 定界 / 凸二次规划

Key words

0-1 Quadratic programming / lower bounding / convex quadratic programming

引用本文

导出引用
朱文兴 , 张连生. 线性约束0-1二次规划的一个定界技术. 系统科学与数学, 1999, 19(1): 65-071. https://doi.org/10.12341/jssms09849
Wen Xing ZHU , Lian Sheng ZHANG. A BOUNDING TECHNIQUE FOR LINEARLY CONSTRAINED 0-1 QUADRATIC PROGRAMMING. Journal of Systems Science and Mathematical Sciences, 1999, 19(1): 65-071 https://doi.org/10.12341/jssms09849
PDF(284 KB)

205

Accesses

0

Citation

Detail

段落导航
相关文章

/