A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

Abstract EN

This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.

The algorithm uses a branch and bound scheme based on an equivalently reverse convex programming problem.

As a result, in the computation procedure the main work is solving a series of linear programs that do not grow in size from iterations to iterations.

Further several key strategies are proposed to enhance solution production, and some of them can be used to solve a general reverse convex programming problem.

Numerical results show that the computational efficiency is improved obviously by using these strategies.