Global optimization for generalized geometric programming problems with discrete variables

Generalized geometric programming (GGP) problems occur frequently in engineering design and management, but most existing methods for solving GGP actually only consider continuous variables. This article presents a new branch-and-bound algorithm for globally solving GGP problems with discrete variab...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization Jg. 62; H. 7; S. 895 - 917
Hauptverfasser: Shen, Pei-Ping, Bai, Xiao-Di
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Taylor & Francis Group 01.07.2013
Taylor & Francis LLC
Schlagworte:
Algorithms
Branch & bound algorithms
Computation
discrete variable
Equivalence
generalized geometric programming
Geometry
global optimization
Linear programming
linearization technique
Lower bounds
Mathematical analysis
Mathematical models
Mathematical programming
Optimization
Optimization techniques
Programming
reduction cut
Studies
Variables
ISSN:0233-1934, 1029-4945
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Generalized geometric programming (GGP) problems occur frequently in engineering design and management, but most existing methods for solving GGP actually only consider continuous variables. This article presents a new branch-and-bound algorithm for globally solving GGP problems with discrete variables. For minimizing the problem, an equivalent monotonic optimization problem (P) with discrete variables is presented by exploiting the special structure of GGP. In the algorithm, the lower bounds are computed by solving ordinary linear programming problems that are derived via a linearization technique. In contrast to pure branch-and-bound methods, the algorithm can perform a domain reduction cut per iteration by using the monotonicity of problem (P), which can suppress the rapid growth of branching tree in the branch-and-bound search so that the performance of the algorithm is further improved. Computational results for several sample examples and small randomly generated problems are reported to vindicate our conclusions.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2011.604871