Article ID: | iaor20105642 |
Volume: | 22 |
Issue: | 3 |
Start Page Number: | 493 |
End Page Number: | 497 |
Publication Date: | Jun 2010 |
Journal: | INFORMS Journal on Computing |
Authors: | Nemhauser George, Ahmed Shabbir, Vielma Juan Pablo |
This paper studies two mixed-integer linear programming (MILP) formulations for piecewise linear functions considered in Li et al. (2009). Although the ideas used to construct one of these formulations are theoretically interesting and could eventually provide a computational advantage, we show that their use in modeling piecewise linear functions yields a poor MILP formulation. We specifically show that neither of the formulations in this paper has a favorable strength property shared by all standard MILP formulations for piecewise linear functions. We also show that both formulations in Li et al. (2009) are significantly outperformed computationally by standard MILP formulations.