Canonical dual approach to solving 0-1 quadratic programming problems

Simple item page
dc.contributorVirginia Techen
dc.contributor.authorFang, S. C.en
dc.contributor.authorGao, D. Y.en
dc.contributor.authorSheu, R. L.en
dc.contributor.authorWu, S. Y.en
dc.contributor.departmentMathematicsen
dc.date.accessed2014-05-09en
dc.date.accessioned2014-05-14T13:23:40Zen
dc.date.available2014-05-14T13:23:40Zen
dc.date.issued2008-02en
dc.description.abstractThis paper presents a canonical duality theory for solving nonconvex polynomial programming problems subjected to box constraints. It is proved that under certain conditions, the constrained nonconvex problems can be converted to the so-called canonical (perfect) dual problems, which can be solved by deterministic methods. Both global and local extrema of the primal problems can be identified by a triality theory proposed by the author. Applications to nonconvex integer programming and Boolean least squares problems are discussed. Examples are illustrated. A conjecture on NP-hard problems is proposed.en
dc.description.sponsorshipUS National Science Foundation Grant No. DMI-0553310, Grant No. CCF-0514768en
dc.description.sponsorshipUS Army Research Office Grant No. W911NF-04-D-0003en
dc.description.sponsorshipNational Science Council of Taiwan under Project No. NSC 96-2115-M-006-014en
dc.identifier.citationFang, S. C.; Gao, D. Y.; Sheu, R. L.; Wu, S. Y., "Canonical dual approach to solving 0-1 quadratic programming problems," J. Industrial and Management Optimization 4(1), 125-142, (2008); DOI: 10.3934/jimo.2008.4.125en
dc.identifier.doihttps://doi.org/10.3934/jimo.2008.4.125en
dc.identifier.issn1547-5816en
dc.identifier.urihttp://hdl.handle.net/10919/47975en
dc.identifier.urlhttp://www.aimsciences.org/journals/displayArticles.jsp?paperID=3089en
dc.language.isoen_USen
dc.publisherAmerican Institute of Mathematical Sciencesen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectglobal optimizationen
dc.subjectdualityen
dc.subjectnonconvex minimizationen
dc.subjectbox constraintsen
dc.subjectinteger programmingen
dc.subjectboolean least squares problemen
dc.subjectnp-hard problemsen
dc.subjectglobal optimizationen
dc.subjectconvex underestimatorsen
dc.subjecttriality theoryen
dc.subjectduality-theoryen
dc.subjectengineering, multidisciplinaryen
dc.subjectoperations research & managementen
dc.subjectscienceen
dc.subjectmathematics, interdisciplinary applicationsen
dc.titleCanonical dual approach to solving 0-1 quadratic programming problemsen
dc.title.serialJournal of Industrial and Management Optimizationen
dc.typeArticle - Refereeden

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
canonical.pdf
Size:
217.38 KB
Format:
Adobe Portable Document Format
Description:
Main article
Download

Collections

Scholarly Works, Mathematics