A Note on “A Superior Representation Method for Piecewise Linear Functions”

References

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