Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 101376, 8 pages
http://dx.doi.org/10.1155/2013/101376
Review Article

A Review of Piecewise Linearization Methods

1Department of Information Technology and Management, Shih Chien University, No. 70 Dazhi Street, Taipei 10462, Taiwan
2Program in Industrial and Systems Engineering, University of Minnesota, 111 Church Street SE, Minneapolis, MN 55455, USA
3School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China
4School of Management, Tokyo University of Science, 500 Shimokiyoku, Kuki, Saitama 346-8512, Japan
5Department of Business Management, National Taipei University of Technology, Section 3, No. 1 Chung-Hsiao E. Road, Taipei 10608, Taiwan

Received 3 July 2013; Accepted 9 September 2013

Academic Editor: Yi-Chung Hu

Copyright © 2013 Ming-Hua Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. F. Tsai, “An optimization approach for supply chain management models with quantity discount policy,” European Journal of Operational Research, vol. 177, no. 2, pp. 982–994, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. E. H. Aghezzaf and L. A. Wolsey, “Modelling piecewise linear concave costs in a tree partitioning problem,” Discrete Applied Mathematics, vol. 50, no. 2, pp. 101–109, 1994. View at Google Scholar · View at MathSciNet · View at Scopus
  3. A. Balakrishnan and S. Graves, “A composite algorithm for a concave-cost network flow problem,” Networks, vol. 19, no. 2, pp. 175–202, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  4. K. L. Croxton, Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management [Ph.D. thesis], Operations Research Center, Massachusetts Institute of Technology, Cambridge, Mass, USA, 1999.
  5. L. M. A. Chan, A. Muriel, Z. J. Shen, and D. Simchi-Levi, “On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures,” Operations Research, vol. 50, no. 6, pp. 1058–1067, 2002. View at Google Scholar · View at MathSciNet · View at Scopus
  6. L. M. A. Chan, A. Muriel, Z. J. M. Shen et al., “Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures,” Management Science, vol. 48, no. 11, pp. 1446–1460, 2002. View at Google Scholar · View at Scopus
  7. K. L. Croxton, B. Gendron, and T. L. Magnanti, “Variable disaggregation in network flow problems with piecewise linear costs,” Operations Research, vol. 55, no. 1, pp. 146–157, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. D. Bienstock and O. Günlük, “Capacitated network design polyhedral structure and computation,” INFORMS Journal on Computing, vol. 8, no. 3, pp. 243–259, 1996. View at Google Scholar · View at Scopus
  9. V. Gabrel, A. Knippel, and M. Minoux, “Exact solution of multicommodity network optimization problems with general step cost functions,” Operations Research Letters, vol. 25, no. 1, pp. 15–23, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. O. Günlük, “A branch-and-cut algorithm for capacitated network design problems,” Mathematical Programming A, vol. 86, no. 1, pp. 17–39, 1999. View at Google Scholar · View at MathSciNet · View at Scopus
  11. T. L. Magnanti, P. Mirchandani, and R. Vachani, “Modeling and solving the two-facility capacitated network loading problem,” Operations Research, vol. 43, no. 1, pp. 142–157, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  12. K. Holmberg, “Solving the staircase cost facility location problem with decomposition and piecewise linearization,” European Journal of Operational Research, vol. 75, no. 1, pp. 41–61, 1994. View at Google Scholar · View at Scopus
  13. K. Holmberg and J. Ling, “A Lagrangean heuristic for the facility location problem with staircase costs,” European Journal of Operational Research, vol. 97, no. 1, pp. 63–74, 1997. View at Google Scholar · View at Scopus
  14. K. L. Croxton, B. Gendron, and T. L. Magnanti, “Models and methods for merge-in-transit operations,” Transportation Science, vol. 37, no. 1, pp. 1–22, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. H. L. Li, C. T. Chang, and J. F. Tsai, “Approximately global optimization for assortment problems using piecewise linearization techniques,” European Journal of Operational Research, vol. 140, no. 3, pp. 584–589, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. F. Tsai and H. L. Li, “A global optimization method for packing problems,” Engineering Optimization, vol. 38, no. 6, pp. 687–700, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J. F. Tsai, P. C. Wang, and M. H. Lin, “An efficient deterministic optimization approach for rectangular packing problems,” Optimization, 2013. View at Publisher · View at Google Scholar
  18. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL—A Modeling Language for Mathematical Programming, The Scientific Press, San Francisco, Calif, USA, 1993.
  19. T. Graf, P. van Hentenryck, C. Pradelles-Lasserre, and L. Zimmer, “Simulation of hybrid circuits in constraint logic programming,” Computers & Mathematics with Applications, vol. 20, no. 9-10, pp. 45–56, 1990. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Martin, M. Möller, and S. Moritz, “Mixed integer models for the stationary case of gas network optimization,” Mathematical Programming, vol. 105, no. 2-3, pp. 563–582, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. M. L. Bergamini, P. Aguirre, and I. Grossmann, “Logic-based outer approximation for globally optimal synthesis of process networks,” Computers and Chemical Engineering, vol. 29, no. 9, pp. 1914–1933, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. M. L. Bergamini, I. Grossmann, N. Scenna, and P. Aguirre, “An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms,” Computers and Chemical Engineering, vol. 32, no. 3, pp. 477–493, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. J. F. Tsai, “Global optimization of nonlinear fractional programming problems in engineering design,” Engineering Optimization, vol. 37, no. 4, pp. 399–409, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. M. H. Lin, J. F. Tsai, and P. C. Wang, “Solving engineering optimization problems by a deterministic global approach,” Applied Mathematics and Information Sciences, vol. 6, no. 7, pp. 21S–27S, 2012. View at Google Scholar · View at MathSciNet
  25. D. Ge, G. Wan, Z. Wang, and J. Zhang, “A note on appointment scheduling with piece-wise linear cost functions,” Working paper, 2012.
  26. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming—Theory and Algorithms, John Wiley & Sons, New York, NY, USA, 2nd edition, 1993. View at MathSciNet
  27. F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, McGraw-Hill, New York, NY, USA, 6th edition, 1995.
  28. H. A. Taha, Operations Research, Macmillan, New York, NY, USA, 7th edition, 2003. View at MathSciNet
  29. C. A. Floudas, Deterministic Global Optimization—Theory, Methods, and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999. View at MathSciNet
  30. S. Vajda, Mathematical Programming, Addison-Wesley, New York, NY, USA, 1964. View at MathSciNet
  31. K. L. Croxton, B. Gendron, and T. L. Magnanti, “A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems,” Management Science, vol. 49, no. 9, pp. 1268–1273, 2003. View at Google Scholar · View at Scopus
  32. H. L. Li, “An efficient method for solving linear goal programming problems,” Journal of Optimization Theory and Applications, vol. 90, no. 2, pp. 465–469, 1996. View at Google Scholar · View at MathSciNet · View at Scopus
  33. H. L. Li and C. S. Yu, “Global optimization method for nonconvex separable programming problems,” European Journal of Operational Research, vol. 117, no. 2, pp. 275–292, 1999. View at Publisher · View at Google Scholar · View at Scopus
  34. H. L. Li and H. C. Lu, “Global optimization for generalized geometric programs with mixed free-sign variables,” Operations Research, vol. 57, no. 3, pp. 701–713, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. M. Padberg, “Approximating separable nonlinear functions via mixed zero-one programs,” Operations Research Letters, vol. 27, no. 1, pp. 1–5, 2000. View at Google Scholar · View at MathSciNet · View at Scopus
  36. H. Topaloglu and W. B. Powell, “An algorithm for approximating piecewise linear concave functions from sample gradients,” Operations Research Letters, vol. 31, no. 1, pp. 66–76, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. S. Kontogiorgis, “Practical piecewise-linear approximation for monotropic optimization,” INFORMS Journal on Computing, vol. 12, no. 4, pp. 324–340, 2000. View at Google Scholar · View at MathSciNet · View at Scopus
  38. H. L. Li and J. F. Tsai, “Treating free variables in generalized geometric global optimization programs,” Journal of Global Optimization, vol. 33, no. 1, pp. 1–13, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. J. P. Vielma, S. Ahmed, and G. Nemhauser, “A note on ‘a superior representation method for piecewise linear functions’,” INFORMS Journal on Computing, vol. 22, no. 3, pp. 493–497, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. H. M. Markowitz and A. S. Manne, “On the solution of discrete programming problems,” Econometrica, vol. 25, no. 1, pp. 84–110, 1957. View at Publisher · View at Google Scholar · View at MathSciNet
  41. G. B. Dantzig, “On the significance of solving linear programming problems with some integer variables,” Econometrica, vol. 28, no. 1, pp. 30–44, 1960. View at Publisher · View at Google Scholar · View at MathSciNet
  42. H. D. Sherali, “On mixed-integer zero-one representations for separable lower-semicontinuous piecewise linear functions,” Operations Research Letters, vol. 28, no. 4, pp. 155–160, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  43. E. L. M. Beale and J. A. Tomlin, “Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables,” in Proceedings of the 5th International Conference on Operations Research, J. Lawrence, Ed., pp. 447–454, Tavistock Publications, London, UK, 1970. View at MathSciNet
  44. I. R. de Farias Jr., E. L. Johnson, and G. L. Nemhauser, “Branch-and-cut for combinatorial optimization problems without auxiliary binary variables,” The Knowledge Engineering Review, vol. 16, no. 1, pp. 25–39, 2001. View at Publisher · View at Google Scholar · View at Scopus
  45. T. Nowatzki, M. Ferris, K. Sankaralingam, and C. Estan, Optimization and Mathematical Modeling in Computer Architecture, Morgan & Claypool Publishers, San Rafael, Calif, USA, 2013.
  46. A. B. Keha, I. R. de Farias, and G. L. Nemhauser, “Models for representing piecewise linear cost functions,” Operations Research Letters, vol. 32, no. 1, pp. 44–48, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. A. B. Keha, I. R. de Farias, and G. L. Nemhauser, “A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization,” Operations Research, vol. 54, no. 5, pp. 847–858, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  48. H. L. Li, H. C. Lu, C. H. Huang, and N. Z. Hu, “A superior representation method for piecewise linear functions,” INFORMS Journal on Computing, vol. 21, no. 2, pp. 314–321, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  49. J. F. Tsai and M. H. Lin, “An efficient global approach for posynomial geometric programming problems,” INFORMS Journal on Computing, vol. 23, no. 3, pp. 483–492, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  50. J. P. Vielma and G. L. Nemhauser, “Modeling disjunctive constraints with a logarithmic number of binary variables and constraints,” Mathematical Programming, vol. 128, no. 1-2, pp. 49–72, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. J. Till, S. Engell, S. Panek, and O. Stursberg, “Applied hybrid system optimization: an empirical investigation of complexity,” Control Engineering Practice, vol. 12, no. 10, pp. 1291–1303, 2004. View at Publisher · View at Google Scholar · View at Scopus
  52. J. F. Tsai and M. H. Lin, “Global optimization of signomial mixed-integer nonlinear programming problems with free variables,” Journal of Global Optimization, vol. 42, no. 1, pp. 39–49, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  53. M. H. Lin and J. F. Tsai, “Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems,” European Journal of Operational Research, vol. 216, no. 1, pp. 17–25, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  54. A. Lundell, Transformation techniques for signomial functions in global optimization [Ph.D. thesis], Åbo Akademi University, 2009.
  55. A. Lundell and T. Westerlund, “On the relationship between power and exponential transformations for positive signomial functions,” Chemical Engineering Transactions, vol. 17, pp. 1287–1292, 2009. View at Google Scholar
  56. A. Lundell, J. Westerlund, and T. Westerlund, “Some transformation techniques with applications in global optimization,” Journal of Global Optimization, vol. 43, no. 2-3, pp. 391–405, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus