Some results on the strength of relaxations of multilinear functions

Mathematical Programming

Volumn 136, Issue 2, 2012, Pages 325-351

  Luedtke, James ^a   Namazifar, Mahdi ^a   Linderoth, Jeff ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Bilinear function; Global optimization; Multilinear function

Indexed keywords

BILINEAR FUNCTIONS; CONVEX ENVELOPE; CONVEX RELAXATION; GLOBAL OPTIMIZATION PROBLEMS; MCCORMICK; MULTILINEAR FUNCTIONS; NUMERICAL EXAMPLE; SINGLE PRODUCT;

RELAXATION PROCESSES;

GLOBAL OPTIMIZATION;

EID: 84870386419     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0606-z     Document Type: Article

References (24)

1. Al-Khayyal, F.; Falk, J.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273-286 (1983)
2. Bao, X.; Sahinidis, N.V.; Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4-5), 485-504 (2009)
3. Belotti, P.; Lee, J.; Liberti, L.; Margot, F.; Wachter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597-634 (2009)
4. Cho, J.; Raje, S.; Sarrafzadeh, M.: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications. IEEE Trans. Comput. 47(11), 1253-1266 (1998) (Pubitemid 128737513)
5. Coppersmith, D.; Günlük, O.; Lee, J.; Leung, J.: A polytope for a product of real linear functions in 0/1 variables. Technical report, IBM Research, Report RC21568 (1999)
6. Crama, Y.: Concave extensions for nonlinear 0-1 maximization problems. Math. Program. 61, 53-60 (1993)
7. Falk, J.; Hoffman, K.: A successive underestimation method for concave minimization problems. Math. Oper. Res. 1, 251-259 (1976)
8. Floudas, C.: Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (2000)
9. Günlük, O.; Lee, J.; Leung, J.: A polytope for a product of real linear functions in 0/1 variables. In: Lee, J.; Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 513-532. Springer, Berlin (2011)
10. Haglin, D.; Venkatesan, S.: Approximation and intractability results for the maximum cut problem and its variants. IEEE Trans. Comp. 40(1), 110-113 (1991)
11. Hochbaum, D.; Megiddo, N.; Naor, J.; Tamir, A.: Tight bounds and 2-Approximation algorithms for integer programs with two variables per inequality. Math. Program.; 62, 69-83 (1993)
12. Kahruman, S.; Kolotoglu, E.; Butenko, S.; Hicks, I.: On greedy construction heuristics for the MAX-CUT problem. Int. J. Comput. Sci. Eng. 3(3), 211-218 (2007)
13. Kajitani, Y.; Cho, J.; Sarrafzadeh, M.: New approximation results on graph matching and related problems. In: Mayr, E.; Schmidt, G.; Tinhofer, G. (eds.) Graph-Theroetic Concepts in Computer Science, Lecture Notes in Computer Science 903, vol. 45, pp. 343-358. Herrsching, Germany (1995)
14. McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems. Math. Program. 10, 147-175 (1976)
15. Meyer, C.; Floudas, C.: Convex envelopes for edge-concave functions. Math. Program. Ser. B 103, 207-224 (2005) (Pubitemid 40878748)
16. Motwani, R.; Raghaven, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
17. Namazifar, M.: Strong relaxations and computations for multilinear programming. Ph.D. thesis, University of Wisconsin-Madison (2011)
18. Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139-172 (1989) (Pubitemid 20597654)
19. Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425-437 (1997) (Pubitemid 127502200)
20. Ryoo, H.S.; Sahinidis, N.V.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19, 403-424 (2001) (Pubitemid 33672346)
21. Sahinidis, N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201-205 (1996)
22. Sherali, H.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math. Vietnam. 22, 245-270 (1997)
23. Smith, E.; Pantelides, C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps. Comput. Chem. Eng. 23, 457-478 (1999) (Pubitemid 29210308)
24. Tawaramalani, M.; Sahinidis, N.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225-249 (2005) (Pubitemid 40878749)