Treating free variables in generalized geometric global optimization programs

檔案

日期

2005-09-01

類型

期刊名稱

JOURNAL OF GLOBAL OPTIMIZATION

卷期與頁次

第 33 卷第 1 期,頁 1–13

ISSN

0925-5001

語言

英文

摘要

Generalized geometric programming (GGP) problems occur frequently in engineering design and management. Recently, some exponential-based decomposition methods [Maranas and Floudas, 1997,Computers and Chemical Engineering 21(4), 351-370; Floudas et al., 1999 , Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers, Boston, pp. 5-105; Floudas, 2000 Deterministic Global Optimizaion: Theory, Methods and Application, Kluwer Academic Publishers, Boston, pp. 257-306] have been developed for GGP problems. These methods can only handle problems with positive variables, and are incapable of solving more general GGP problems. This study proposes a technique for treating free (i.e., positive, zero or negative) variables in GGP problems. Computationally effective convexification rules are also provided for signomial terms with three variables.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Li, H., & Tsai, J. (2005). Treating free variables in generalized geometric global optimization programs. JOURNAL OF GLOBAL OPTIMIZATION, 33(1), 1–13. https://doi.org/10.1007/s10898-005-2098-3

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13320