A method of acceleration for a class of multiplicative programming problems with exponent

Authors:
Xue-Gang Zhou;Kun Wu
Affiliations:
Mathematics Science and Computing Technology School, Center South University, Changsha, Hunan, 410075, China;Mathematics Science and Computing Technology School, Center South University, Changsha, Hunan, 410075, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 5
Cited 1

Finite algorithm for generalized linear multiplicative programming

Journal of Optimization Theory and Applications
Outcome-space cutting-plane algorithm for linear multiplicative programming

Journal of Optimization Theory and Applications
A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming

Computational Optimization and Applications
Heuristic Methods for Linear Multiplicative Programming

Journal of Global Optimization
Global Optimization of Multiplicative Programs

Journal of Global Optimization

A new linearization method for generalized linear multiplicative programming

Computers and Operations Research

Quantified Score

Hi-index	7.29

Visualization

Abstract

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 MPE 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.