On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope

In this paper, a finite branch‐and‐bound algorithm is developed for the minimization of a concave power law over a polytope. Linear terms are also included in the objective function. Using the first order necessary conditions of optimality, the optimization problem is transformed into an equivalent problem consisting of a linear objective function, a set of linear constraints, a set of convex constraints, and a set of bilinear complementary constraints. The transformed problem is then solved using a finite branch‐and‐bound algorithm that solves two convex problems at each of its nodes. The method is illustrated by means of an example from the literature.