A note on "a superior representation method for piecewise linear functions"

INFORMS Journal on Computing

Volumn 22, Issue 3, 2010, Pages 493-497

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

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Pittsburgh   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Mathematics: Piecewise linear; Programming: Integer

Indexed keywords

EID: 77955499064     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0379     Document Type: Article

References (12)

1. Bonami, P., L. T. Biegler, A. R. Conn, G. Cornuéjols, I. E. Grossmann, C. D. Laird, J. Lee et al. 2008. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5 (2) 186-204.
2. Dantzig, G. B. 1960. On the significance of solving linear programming problems with some integer variables. Econometrica 28 (1) 30-44.
3. Dantzig, G. B. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
4. Garfinkel, R. S., G. L. Nemhauser. 1972. Integer Programming. John Wiley & Sons, New York.
5. ILOG. 2008. ILOG CPLEX user's manual. IBM ILOG, Armonk, NY. http://www.ibm.com/software/integration/optimization/cplex.
6. Jeroslow, R. G., J. K. Lowe. 1984. Modelling with integer variables. B. Korte, K. Ritter, eds. Mathematical Programming Study 22: Mathematical Programming at Oberwolfach II. North Holland, Amsterdam, 167-184.
7. Li, H.-L., H.-C. Lu, C.-H. Huang, N.-Z. Hu. 2009. A superior representation method for piecewise linear functions. INFORMS J. Comput. 21 (2) 314-321.
8. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
9. Padberg, M. 2000. Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27 (1) 1-5.
10. Vielma, J. P., S. Ahmed, G. L. Nemhauser. 2010. Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions. Oper. Res. 58 (2) 303-315.
11. 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, 2008, Lecture Notes in Computer Science, Vol. 5035. Springer, Berlin, 199-213.
12. Vielma, J. P., G. L. Nemhauser. 2009. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Programming, ePub ahead of print July 6, http://www.springerlink.com/content/ w2555234j463r667.