A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

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

Celý popis

Podrobná bibliografie

Hlavní autoři:	Lin-Peng Yang, Pei-Ping Shen, Yong-Gang Pei
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Wiley 2014-01-01
Edice:	Abstract and Applied Analysis
On-line přístup:	http://dx.doi.org/10.1155/2014/641909
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!