On linear multiplicative programming

Global minimization of quasi-concave functions over a polyhedral set is often considered as a difficult optimization problem. In this paper we consider a special case of this, called the linear multiplicative programming problem. Two algorithms are suggested, one based on linear parametric cost analysis of linear programs and the other using cutting planes along with the parametric analysis. Extensive computational results are also presented and a comparative study is made with the available algorithms.