کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506998 | 1340765 | 2005 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Linearization method of global optimization for generalized geometric programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Many methods for solving generalized geometric programming (GGP) problem can only find locally optimal solutions. But up to now, less work has been devoted to solving global optimization of GGP due to the inherent difficulty. This paper gives a method for finding the globally optimal solutions of GGP. Utilizing an exponentially variable transformation and some other techniques the initial nonlinear and nonconvex GGP problem is reduced to a sequence of linear programming problems. The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Several GGP examples in the literatures are tested to demonstrate that the proposed method can systematically solve these examples to find the global optimum within a prespecified error.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 162, Issue 1, 4 March 2005, Pages 353-370
Journal: Applied Mathematics and Computation - Volume 162, Issue 1, 4 March 2005, Pages 353-370
نویسندگان
Peiping Shen,