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!

Schreiben Sie den ersten Kommentar!