VTechWorks staff will be away for the Thanksgiving holiday starting at noon on Wednesday, November 21, through Friday, November 23, and will not be replying to requests during this time. Thanks for your patience, and happy holidays!
Canonical dual approach to solving 0-1 quadratic programming problems
This 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.