کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1706163 1012452 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Revised multi-choice goal programming
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Revised multi-choice goal programming
چکیده انگلیسی

Chang [C.-T. Chang, Multi-choice goal programming, Omega, The Inter. J. Manage. Sci. 35 (2007) 389–396] has recently proposed a new method namely multi-choice goal programming (MCGP) for multi-objective decision problems. The multi-choice goal programming allows the decision maker to set multi-choice aspiration levels for each goal to avoid underestimation of the decision. However, to express the multi-choice aspiration levels, multiplicative terms of binary variables are involved in their model. This leads to difficult implementation and it is not easily understood by industrial participants. In this paper, we propose an alternative method to formulate the multi-choice aspiration levels with two contributions: (1) the alternative approach does not involve multiplicative terms of binary variables, this leads to more efficient use of MCGP and is easily understood by industrial participants, and (2) the alternative approach represents a linear form of MCGP which can easily be solved by common linear programming packages, not requiring the use of integer programming packages. In addition, a new concept of constrained MCGP is introduced for constructing the relationships between goals in this paper. Finally, to demonstrate the usefulness of the proposed method, an illustrate example is included.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 32, Issue 12, December 2008, Pages 2587–2595
نویسندگان
,