Abstract
This paper deals with the reformulation of a polynomial integer program. For deducing a linear integer relaxation of such a program a class of polyhedra that are associated with nonlinear functions is introduced. A characterization of the family of polynomials for which our approach leads to an equivalent linear integer program is given. Finally the family of so-called integer-convex polynomials is defined, and polyhedra related to such a polynomial are investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Mathematics of Operations Research 8 (2), 273–286 (1983)
Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Operations Research 19, 19–39 (1971)
Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming 58, 295–324 (1993)
Gangadwala, J., Kienle, A., Haus, U.U., Michaels, D., Weismantel, R.: Optimal process design for the synthesis of 2,3-dimethylbutene-1 (2005). Manuscript
Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22, 180–182 (1974)
Hiriart-Urruty, J.B., Lemaréchal, C.: Convex analysis and minimization algorithms. Part 1: Fundamentals. Grundlehren der Mathematischen Wissenschaften. 305. Berlin: Springer- Verlag. xvii, 417 p. DM 128.00; sfr 128.00 (1993)
Lasserre, J.B.: An explicit exact sdp relaxation for nonlinear 0–1 programs. In: K.e.a. Aardal (ed.) Integer programming and combinatorial optimization. 8th international IPCO conference, Utrecht, Netherlands, June 13–15, Lecture Notes Computer Science, vol. 2081, pp. 293–303. Springer (2001)
Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (3), 796–817 (2001)
Lasserre, J.B.: Polynomials nonnegative on a grid and discrete optimization. Trans. Am. Math. Soc. 354 (2), 631–649 (2002)
Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming. Math. Oper. Res. 28 (3), 470–496 (2003)
Laurent, M.: Semidefinite representations for finite varieties (December 2002 [updated on February 13, 2003]). To appear in Mathematical Programming. Preprint available from http://home/pag/es.cwi.nl/~mo/nique/
Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim. 1 (2), 166–190 (1991)
Nesterov, Y.: Squared functional systems and optimization problems. In: H.e.a. Frenk (ed.) High performance optimization, Appl. Optim., vol. 33, pp. 405–440. Kluwer Academic Publishers, Dordrecht (2000)
Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B 96 (2), 293–320 (2003)
Schmüdgen, K.: The k-moment problem for compact semi-algebraic sets. Math. Ann. 289 (2), 203–-206 (1991)
Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 (3), 411–430 (1990)
Shor, N.Z.: Quadratic optimization problems. Izv. Akad. Nauk SSSR Tekhn. Kibernet. (1), 128–139, 222 (1987)
Watters, L.J.: Reduction of integer polynomial programmming problems to zero-one linear programming problems. Operations Research 15, 1171–1174 (1967)
Williams, H.: Model building in mathematical programming. A Wiley-Interscience Publication. Chichester etc.: John Wiley & Sons Ltd. xiv, 356 p. (1990). Reprinted September 1994
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by DFG-Forschergruppe FOR-468
Received: April, 2004
Rights and permissions
About this article
Cite this article
Michaels, D., Weismantel, R. Polyhedra related to integer-convex polynomial systems. Math. Program. 105, 215–232 (2006). https://doi.org/10.1007/s10107-005-0650-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0650-z