OUTCOME-SPACE OUTER APPROXIMATION ALGORITHM FOR LINEAR MULTIPLICATIVE PROGRAMMING

Abstract

This paper presents an outcome-space outer approximation algorithm for globally solving the linear multiplicative programming problem. We prove that the proposed algorithm is finite. To illustrate the new algorithm, we apply it to solve some sample problems.