American Journal of Computational Mathematics
Volume 3, Issue 3 (September 2013)
ISSN Print: 2161-1203 ISSN Online: 2161-1211
Google-based Impact Factor: 0.42 Citations
Complete Solutions to Mixed Integer Programming ()
Affiliation(s)
ABSTRACT
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, by polynomial algorithms.
KEYWORDS
Share and Cite:
Cited by
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.