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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Optimization Ročník 62; číslo 7; s. 895 - 917
Hlavní autori:	Shen, Pei-Ping, Bai, Xiao-Di
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis Group 01.07.2013 Taylor & Francis LLC
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!