A superior representation method for piecewise linear functions

INFORMS Journal on Computing

Volumn 21, Issue 2, 2009, Pages 314-321

  Li, Han Lin ^a   Lu, Hao Chun ^b   Huang, Chia Hui ^c   Hu, Nian Ze ^d  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b FU JEN CATHOLIC UNIVERSITY   (Taiwan)

^c KAINAN UNIVERSITY   (Taiwan)

^d NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Integer; Mathematics; Piecewise linear; Programming

Indexed keywords

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

References (11)

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