摘要

Multiplicative programming problems with exponent (MPE) have many practical applications in various fields. In this paper, a method for accelerating global optimization is proposed for a class of multiplicative programming problems with exponent under multiplicative constraints using a Suitable deleting technique. This technique offers the possibility of cutting away a large part of the currently investigated region in which the globally optimal solution of the WE does not exist. The deleting technique can accelerate the convergence of the proposed global optimization algorithm. Two numerical examples are given to illustrate the feasibility of the deleting technique.