%0 Journal Article
%T Complete Solutions to Mixed Integer Programming
%A Ning Ruan
%J American Journal of Computational Mathematics
%P 27-30
%@ 2161-1211
%D 2013
%I Scientific Research Publishing
%R 10.4236/ajcm.2013.33B005
%X <p class=\"MsoNormal\">
	<span lang=\"EN-US\">This paper considers a new canonical duality theory for solving mixed
integer quadratic programming problem. It shows that this well-known NP-hard
problem can be converted into concave maximization dual problems without duality
gap. And the dual problems can be solved, under certain conditions,</span><span lang=\"EN-US\"> </span><span lang=\"EN-US\">by polynomial algorithms.</span>
</p>
%K Duality Theory
%K Double Well
%K Global Optimization
%K Canonical Dual Transformation
%K Combinatorial  Optimization
%K NP-hard Problems
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=38516