Mathematics – Optimization and Control
Scientific paper
2009-05-11
Mathematics
Optimization and Control
21 pages
Scientific paper
We consider integer programming and the semi-group membership problem. We provide the following theorem of the alternative: the system Ax=b has no nonnegative integral solution x if and only if p(b) <0 for some given polynomial p whose vector of coefficients lies in a convex cone that we characterize. We also provide a hierarchy of linear programming relaxations, where the continuous case Ax=b with x real and nonnegative, describes the first relaxation in the hierarchy.
Lasserre Jean
Zeron S.
No associations
LandOfFree
Certificates and relaxations for integer programming and the semi-group membership problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Certificates and relaxations for integer programming and the semi-group membership problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Certificates and relaxations for integer programming and the semi-group membership problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-701253