𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Xue-Gang Zhou; Kun Wu

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
487 KB
Volume
223
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

a b s t r a c t

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.

πŸ“œ SIMILAR VOLUMES

A new accelerating method for globally s
A new accelerating method for globally solving a class of nonconvex programming problems
✍ Peiping Shen; Xiaodi Bai; Weimin Li πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi

Duality for a Class of Nondifferentiable
Duality for a Class of Nondifferentiable Multiobjective Programming Problems
✍ Xin Min Yang; Kok Lay Teo; Xiao Qi Yang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 64 KB

In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established