کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9506841 | 1340760 | 2005 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch and bound algorithm for solving a class of D-C programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The D-C (difference of convex functions) programming occurs very often in economic and financial field. In this paper, a class of D-C programming problems be studied, witch objection function is the sum of a convex quadratic function and a separable concave function, the constrains is the intersection of a polytop and a rectangular. A branch and bound algorithm is given for solving it. we compare the largest distance bisection with Ï-subdivision in branch and bound algorithm. Numerical tests on different dimensions showed that the proposed branch and bound algorithm is efficient for solving medium-scale problems, and the efficiency of the largest distance bisection and Ï-subdivision is nearly.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 165, Issue 2, 15 June 2005, Pages 291-302
Journal: Applied Mathematics and Computation - Volume 165, Issue 2, 15 June 2005, Pages 291-302
نویسندگان
Xue Honggang, Xu Chengxian,