کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4636635 | 1340726 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Global optimization of generalized linear fractional programming with nonlinear constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper presents a branch-and-bound algorithm for globally solving a wide class of generalized linear fractional programming problems (GLFP). This class includes such problems as: minimizing a sum, or error for product of a finite number of ratios of linear functions, linear multiplicative programming, polynomial programming, etc. - over nonconvex feasible region. First a problem (Q) is derived which is equivalent to problem (GLFP). In the algorithm, lower bounds are derived by solving a sequence of linear relaxation programming problems, which is based on the construction of the linear lower bounding functions for the objective function and constraint functions of problem (Q) over the feasible region. Convergent property of the presented algorithm is proved and numerical results are given to show the feasibility of the proposed algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 183, Issue 2, 15 December 2006, Pages 717-728
Journal: Applied Mathematics and Computation - Volume 183, Issue 2, 15 December 2006, Pages 717-728
نویسندگان
Hongwei Jiao, Yunrui Guo, Peiping Shen,