Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation (Q2432723)

The authors study the optimization problem where the objective function is a separable non-linear function and the constraints are linear. The article starts with a short background introduction to this problem, followed by a description of the piecewise linear approximation approach which is the main contribution of this work. A model of implementing the proposed approach then follows, which concludes with a solved numerical example. The article concludes with a list of useful references.