Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Shaanxi University of Technology(Natural Science Edition)》 2015-06
Add to Favorite Get Latest Update

Method of constructing test problems for constrained binary quadratic programming

YONG Long-quan;School of Mathematics and Computer Science,Shaanxi University of Technology;  
Based on Gerschgorin's disk theorem,a method of constructing test function with known global solution for a class of constrained binary quadratic programming is presented. By using the linear transformation,a new indefinite quadratic programming is obtained,whose minimum occurs at the initial point over the given domains. Furthermore,a series of binary quadratic programming that has a common optimal solution is constructed.
【Fund】: 陕西理工学院科研计划项目(SLGKYQD2-14)
【CateGory Index】: O221
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved