A MILP formulation for generalized geometric programming using piecewise-linear approximations

摘要

Generalized geometric programming (GGP) problems are converted to mixed-integer linear programming (MILP) problems using piecewise-linear approximations. Our approach is to approximate a multiple-term log-sum function of the form log(x(1) + x(2) + ... +x(n)) in terms of a set of linear equalities or inequalities of logx(1), logx(2), ... , and logx(n), where x(1,) ... , x(n), are strictly positive. The advantage of this approach is its simplicity and readiness to implement and solve using commercial MILP solvers. While MILP problems in general are no easier than GGP problems, this approach is justified by the phenomenal progress of computing power of both personal computers and commercial MILP solvers. The limitation of this approach is discussed along with numerical tests. (C) 2015 Elsevier B.V. All rights reserved.