Signomial geometric programming (SGP) has been an interesting problem for many authors recently. Many methods have been provided for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. In this paper we propose a new accelerating method for glob
β¦ LIBER β¦
An experimental investigation of Geschke's method of global program optimization
β Scribed by S. Matwin
- Book ID
- 113161929
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 316 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Accelerating method of global optimizati
β
Pei-Ping Shen; Xiao-ai Li; Hong-Wei Jiao
π
Article
π
2008
π
Elsevier Science
π
English
β 179 KB
Taboo evolutionary programming: a new me
β
Ji, Mingjun; Klinowski, Jacek
π
Article
π
2006
π
The Royal Society
π
English
β 463 KB
An optimization of Chebyshevβs method
β
J.A. Ezquerro; M.A. HernΓ‘ndez
π
Article
π
2009
π
Elsevier Science
π
English
β 966 KB
An approximate approach of global optimi
β
Han-Lin Li; Ching-Ter Chang
π
Article
π
1998
π
Elsevier Science
π
English
β 626 KB
Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable xi as the addition of a discrete variable dj and
An Experimental Investigation of Optimal
β
Andreas Blume; Uri Gneezy
π
Article
π
2000
π
Elsevier Science
π
English
β 112 KB
Optimal experimental methods of the larg
β
Jilin Cheng; Yuanyu Guo; Zhaosen Jin; Changsheng Tao; Baohua Chen
π
Article
π
1998
π
SP Science China Press
π
English
β 343 KB