Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions

Operations Research

Volumn 58, Issue 2, 2010, Pages 303-315

  Vielma, Juan Pablo ^a   Ahmed, Shabbir ^a   Nemhauser, George ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Mixed integer programming; Piecewise linear functions

Indexed keywords

COMPUTATIONAL PERFORMANCE; CONTINUOUS PIECEWISE-LINEAR FUNCTION; MIXED-INTEGER PROGRAMMING; NONCONVEX; NONSEPARABLE; PIECEWISE LINEAR FUNCTIONS; PIECEWISE-LINEAR; SEMI-CONTINUOUS;

DYNAMIC PROGRAMMING; PIECEWISE LINEAR TECHNIQUES; PLASMA WAVES;

INTEGER PROGRAMMING;

EID: 77951161656     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0721     Document Type: Article

References (45)

1. Aichholzer, O., F. Aurenhammer, F. Hurtado, H. Krasser. 2003. Towards compatible triangulations. Theoret. Comput. Sci. 296 3-13.
2. Balakrishnan, A., S. C. Graves. 1989. A composite algorithm for a concave-cost network flow problem. Networks 19 175-202.
3. Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
4. Bergamini, M. L., P. Aguirre, I. Grossmann. 2005. Logic-based outer approximation for globally optimal synthesis of process networks. Comput. Chemical Engrg. 29 1914-1933.
5. Bergamini, M. L., I. Grossmann, N. Scenna, P. Aguirre. 2008. An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chemical Engrg. 32 477-493.
6. Carnicer, J. M., M. S. Floater. 1996. Piecewise linear interpolants to Lagrange and Hermite convex scattered data. Numer. Algorithms 13 345-364.
7. Coppersmith, D., J. Lee. 2005. Parsimonious binary-encoding in integer programming. Discrete Optim. 2 190-200.
8. Croxton, K. L., B. Gendron, T. L. Magnanti. 2003a. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. 49 1268-1273.
9. Croxton, K. L., B. Gendron, T. L. Magnanti. 2003b. Models and methods for merge-in-transit operations. Transportation Sci. 37 1-22.
10. Croxton, K. L., B. Gendron, T. L. Magnanti. 2007. Variable disaggregation in network flow problems with piecewise linear costs. Oper. Res. 55 146-157.
11. Dantzig, G. B. 1960. On the significance of solving linear-programming problems with some integer variables. Econometrica 28 30-44.
12. Dantzig, G. B. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
13. de Farias, I. R., Jr., M. Zhao, H. Zhao. 2008. A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36 234-238.
14. Fourer, R., D. M. Gay, B. W. Kernighan. 1993. AMPL-A Modeling Language for Mathematical Programming. The Scientific Press.
15. Garfinkel, R. S., G. L. Nemhauser. 1972. Integer Programming. Wiley, New York.
16. Graf, T., P. Vanhentenryck, C. Pradelleslasserre, L. Zimmer. 1990. Simulation of hybrid circuits in constraint logic programming. Comput. Math. Appl. 20 45-56.
17. Ibaraki, T. 1976. Integer programming formulation of combinatorial optimization problems. Discrete Math. 16 39-52.
18. Jeroslow, R. G. 1987. Representability in mixed integer programming 1: Characterization results. Discrete Appl. Math. 17 223-243.
19. Jeroslow, R. G. 1989. Representability of functions. Discrete Appl. Math. 23 125-137.
20. Jeroslow, R. G., J. K. Lowe. 1984. Modeling with integer variables. Math. Programming Stud. 22 167-184.
21. Jeroslow, R. G., J. K. Lowe. 1985. Experimental results on the new techniques for integer programming formulations. J. Oper. Res. Soc. 36 393-403.
22. Kannan, R. 1992. Lattice translates of a polytope and the Frobenius problem. Combinatorica 12 161-177.
23. Keha, A. B. 2003. A polyhedral study of nonconvex piecewise linear optimization. Ph.D. thesis, Georgia Institute of Technology, Atlanta.
24. Keha, A. B., I. R. de Farias, G. L. Nemhauser. 2004. Models for representing piecewise linear cost functions. Oper. Res. Lett. 32 44-48.
25. Keha, A. B., I. R. de Farias, G. L. Nemhauser. 2006. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54 847-858.
26. Lasdon, L. S., A. D. Waren. 1980. A survey of nonlinear programming applications. Oper. Res. 28 1029-1073.
27. Lee, J., D. Wilson. 2001. Polyhedral methods for piecewise-linear functions I: The lambda method. Discrete Appl. Math. 108 269-285.
28. Lowe, J. K. 1984. Modelling with integer variables. Ph.D. thesis, Georgia Institute of Technology, Atlanta.
29. Magnanti, T. L., D. Stratila. 2004. Separable concave optimization approximately equals piecewise linear optimization. G. L. Nemhauser, D. Bienstock, eds. IPCO, Lecture Notes in Computer Science, Vol.3064. Springer, Berlin, 234-243.
30. Markowitz, H., A. Manne. 1957. On the solution of discrete programming problems. Econometrica 25 84-110.
31. Martin, A., M. Moller, S. Moritz. 2006. Mixed integer models for the stationary case of gas network optimization. Math. Programming 105 563-582.
32. Meyer, R. R. 1976. Mixed integer minimization models for piecewiselinear functions of a single variable. Discrete Math. 16 163-171.
33. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley-Interscience, New York.
34. Padberg, M. 2000. Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27 1-5.
35. Padberg, M. W., M. P. Rijal. 1996. Location, Scheduling, Design, and Integer Programming. Kluwer Academic Publishers, Boston.
36. Pottmann, H., R. Krasauskas, B. Hamann, K. I. Joy, W. Seibold. 2000. On piecewise linear approximation of quadratic functions. J. Geometry and Graphics 4 9-31.
37. Sherali, H. D. 2001. On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. 28 155-160.
38. Todd, M. J. 1977. Union Jack triangulations. S. Karamardian, ed. Fixed Points: Algorithms and Applications. Academic Press, New York, 315-336.
39. Tomlin, J. A. 1981. A suggested extension of special ordered sets to nonseparable non-convex programming problems. P. Hansen, ed. Studies on Graphs and Discrete Programming, Annals of Discrete Mathematics, Vol.11. North-Holland, Amsterdam, 359-370.
40. Vajda, S. 1964. Mathematical Programming. Addison-Wesley, Reading, MA.
41. Vielma, J. P., G. L. Nemhauser. 2008. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. A. Lodi, A. Panconesi, G. Rinaldi, eds. IPCO, Lecture Notes in Computer Science, Vol.5035. Springer, Berlin, 199-213.
42. Vielma, J. P., G. L. Nemhauser. 2009. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Programming. Forthcoming.
43. Vielma, J. P., A. B. Keha, G. L. Nemhauser. 2008. Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optim. 5 467-488.
44. Wilf, H. S. 1989. Combinatorial Algorithms-An Update. Society for Industrial and Applied Mathematics, Philadelphia.
45. Wilson, D. L. 1998. Polyhedral methods for piecewise-linear functions. Ph.D. thesis, University of Kentucky, Lexington.