Integer and combinatorial optimization
Integer and combinatorial optimization
A Superior Representation Method for Piecewise Linear Functions
INFORMS Journal on Computing
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Mathematical Programming: Series A and B
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization
Approximating separable nonlinear functions via mixed zero-one programs
Operations Research Letters
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
Operations Research
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
Operations Research
Hi-index | 0.00 |
This paper studies two mixed-integer linear programming (MILP) formulations for piecewise linear functions considered in Li et al. [Li, H.-L., H.-C. Lu, C.-H. Huang, N.-Z. Hu. 2009. A superior representation method for piecewise linear functions. INFORMS J. Comput.21(2) 314--321]. 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.