A Superior Representation Method for Piecewise Linear Functions

References

• Bazaraa M. S., Sherali H. D., Shetty C. M.Nonlinear Programming: Theory and Algorithms (1993) (John Wiley & Sons, New York) . 2nd ed.Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. (2003) 49(9):1268–1273Link, 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
• Dixon L. C. W., Szegö G. P.Towards Global Optimization (1975) (North-Holland, Amsterdam) Google Scholar
• Floudas C. A.Deterministic Global Optimization: Theory, Methods, and Applications (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• ILOG ILOG, Release 3.7. (2003) (ILOG Software Inc., San Diego) Google Scholar
• Kontogiorgis S. Practical piecewise-linear approximation for monotropic optimization. INFORMS J. Comput. (2000) 12(4):324–340Link, Google Scholar
• Li H. L. Notes: An efficient method for solving linear goal programming problems. J. Optimiz. Theory Appl. (1996) 90(2):465–469Crossref, Google Scholar
• Li H. L., Lu H. C. Global optimization for generalized geometric programs with mixed free-sign variables. Oper. Res. (2009) . ePub ahead of print March 30, http://dx.doi.org/10.1287/opre.1080.0586Link, Google Scholar
• Lindo LINGO, Release 9. (2004) (Lindo Systems Inc., Chicago) Google Scholar
• Padberg M. Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. (2000) 27(1):1–5Crossref, Google Scholar
• Topaloglu H., Powell W. B. An algorithm for approximating piecewise linear concave functions from sample gradients. Oper. Res. Lett. (2003) 31(1):66–76Crossref, Google Scholar
• Vajda S.Mathematical Programming (1964) (Addison-Wesley, New York) Google Scholar