Certificates and relaxations for integer programming and the semi-group membership problem

Simple item page
dc.creatorLasserre, Jean
dc.creatorZeron, S.
dc.date2009-05-11
dc.date.accessioned2026-07-07T13:13:42Z
dc.date.available2026-07-07T13:13:42Z
dc.descriptionWe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/0905.1608
dc.identifierhttp://arxiv.org/abs/0905.1608
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229977
dc.subjectOptimization and Control
dc.subjectDiscrete Mathematics
dc.subject90, C10
dc.titleCertificates and relaxations for integer programming and the semi-group membership problem
dc.typetext

Files

Collections

arXiv