๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A global optimization approach for solving the convex multiplicative programming problem

โœ Scribed by Nguyen Thoai


Publisher
Springer US
Year
1991
Tongue
English
Weight
830 KB
Volume
1
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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