Finite algorithm for generalized linear multiplicative programming

The nonconvex problem of minimizing the sum of a linear function and the product of two linear functions over a convex polyhedron is considered. A finite algorithm is proposed which either finds a global optimum or shows that the objective function is unbounded from below in the feasible region. This is done by means of a sequence of primal and/or dual simplex iterations.