کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9507110 | 1340769 | 2005 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An approximate approach for fractional programming with absolute-value functions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers the following fractional programming with absolute-value functions: (FP-A):minZ=α+âj=1ncj|xj|β+âj=1ndj|xj|=N(x)D(x)subjecttoAx=b,where xTâRn is unrestricted; bTâRm; α and β are the scalars; A is an mân matrix; cjs and djs are unconstrained in sign. In some cases when some of cjs are positive and others are negative, adjacent extreme point (simplex-type) methods [Oper. Res. 19/1 (1971) 120; Eur. J. Oper. Res. 141 (2002) 233; Oper. Res. 13/6 (1965) 1029; Fractional Programming, Heldermann Verlag, Berlin, 1988] cannot be used to solve the problem (FP-A). In view of this, this paper proposes an approximate approach to reaching as close as possible an optimal solution of the problem (FP-A). First, the problem (FP-A) is converted into an equivalent non-linear quadratic mixed integer programming with absolute value. Then the model is linearized using piecewise logarithmic program with some linearization techniques. The whole problem is then solvable using the branch and bound method. The numerical example demonstrates that the proposed model can easily be applied to problem (FP-A).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 161, Issue 1, 4 February 2005, Pages 171-179
Journal: Applied Mathematics and Computation - Volume 161, Issue 1, 4 February 2005, Pages 171-179
نویسندگان
Ching-Ter Chang,