|
Solving fully fuzzy Linear Programming Problem using Breaking Points
|
| |
|
|
|
چکیده: (10886 مشاهده) |
| Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy
quantities which are LR triangular fuzzy numbers. The given linear programming problem is
rearranged according to the satisfactory level of constraints using breaking point method. By
considering the constraints, the arranged problem has been investigated for all optimal solutions
connected with satisfactory level of quantities on all intervals that constituted from breaking points of
the constraints. Optimal solution could be obtained on the constructed [ p-1 , p] intervals for
p=1,2… Here the fuzzy primal simplex algorithm is designed based on revised TSAO’s ranking
method.
Keywords: Triangular Fuzzy Number, Ranking Fuzzy Number, Revised Tsao’s Method ,Fuzzy Linear
Programming Problem, Breaking Point, Fuzzy Primal Simplex Algorithm. |
|
| |
|
|
متن کامل [PDF 1393 kb]
(4981 دریافت)
|
نوع مطالعه: پژوهشي |
موضوع مقاله:
تخصصي
دریافت: 1391/7/1 | انتشار: 1391/6/25
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
