تجزیه و تحلیل حساسیت در مشکلات برنامه ریزی خطی تعداد فازی
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|25245||2011||12 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 7540 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Mathematical and Computer Modelling, Volume 53, Issues 9–10, May 2011, Pages 1878–1888
In this paper, we generalize the concept of sensitivity analysis in fuzzy number linear programming (FLNP) problems by applying fuzzy simplex algorithms and using the general linear ranking functions on fuzzy numbers. The purpose of sensitivity analysis is to determine changes in the optimal solution of FNLP problem resulting from changes in the data. If the change affects the optimality of the basis, we perform primal pivots to achieve optimality by use of the fuzzy primal simplex method. Whenever the change destroys the feasibility of the optimal basis, we perform dual pivots to achieve feasibility by use of the fuzzy dual simplex method.
The concept of fuzzy mathematical programming on a general level was first proposed by Tanaka et al.  in the framework of the fuzzy decision of Bellman and Zadeh . The first formulation of fuzzy linear programming (FLP) is proposed by Zimmermann . Afterwards, many authors have considered various kinds of FLP problems and have proposed several approaches for solving these problems , , , , , , , , ,  and . To solve a multi objective programming problem with fuzzy coefficients Wu  transformed the problem into a vector optimization problem by applying the embedding theorem and a suitable linear defuzzification function. Katagiri et al.  considered a multi-objective 0–1 programming problem with fuzzy random variables as coefficients of objective functions and proposed a decision-making model maximizing the expected degrees of possibility that the objective function values attained the fuzzy goals. Iskander  introduced a stochastic fuzzy linear multi objective programming problem and transformed it to a stochastic fuzzy linear programming problem using a fuzzy weighted objective function. They, used chance-constrained approach as well as the αα-level methodology to transform the stochastic fuzzy linear programming problem to its equivalent deterministic-crisp linear programming problem. In addition, some authors have used the concept of comparison of fuzzy numbers to solve fuzzy linear programming problems. In fact, most convenient methods are based on the concept of comparison of fuzzy numbers by using linear ranking functions , , , ,  and . Of course, linear ranking functions have been proposed by researchers to suit their requirements of the problem under consideration and conceivably there are no generally accepted criteria for application of ranking functions. Nevertheless, usually in such situations authors define a crisp model which is equivalent to an FLP problem and then use optimal solution of the model as the optimal solution of the FLP problem. Based on this idea Maleki et al.  proposed a new method for solving the FNLP problem and used its solution to obtain the fuzzy solution of the fuzzy variable linear programming (FVLP) problem. Mahdavi-Amiri and Nasseri  extended the concepts of duality in FNLP problems as a similar problem leading to the dual simplex algorithm  for solving such problems. However, the method of Malkei et al.  has a shortcoming and it is not efficient when the decision variables are bounded in the FNLP problem. Thus, some authors proposed a new approach to overcome this shortcoming based on dual and primal simplex methods  and . Moreover, Mahdavi-Amiri and Nasseri  used a certain linear ranking function to define the dual of FNLP problems as FVLP problems that lead to an efficient method called the dual simplex algorithm for solving FVLP problems directly. After that, Ebrahimnejad et al.  gave another efficient method namely primal–dual simplex algorithm to obtain a fuzzy solution of FVLP problems. Also, Nasseri and Ebrahimnejad  applied a fuzzy primal simplex method  to solve flexible linear programming problems directly without solving any auxiliary problem. Moreover, Ebrahimnejad and Nasseri  used the complementary slackness to solve FNLP and FVLP problems without the need of a simplex table. Hosseinzadeh Lotfi et al.  discussed full FLP problems of which all parameters and variable triangular fuzzy numbers. They used the concept of the symmetric triangular fuzzy number and introduced an approach to defuzzify a general fuzzy quantity. Ganesan and Veeramani  introduced a new method for solving a kind of linear programming problem involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems based on primal simplex algorithm. Ebrahimnejad et al.  developed their method for situations in which some or all fuzzy decision variables are bounded. Some authors  and  developed the dual of a linear programming problem with symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems. In published works on fuzzy linear programming there are only a few papers dealing with stability or sensitivity analysis in fuzzy mathematical programming. Sensitivity analysis in FLP problems (with crisp parameters and soft constraints) was first considered by Hamacher et al. , where a functional relationship between changes of parameters of the right-hand side and those of the optimal value of the primal objective function was derived for almost all conceivable cases. Sensitivity analysis for fuzzy linear fractional programming problems (FLFP) was studied by Dutta et al. . Tanaka et al.  have discussed the value of information in an FLP problem (with symmetrical triangular fuzzy numbers) via sensitivity analysis. Fullér  investigated the stability of the solution of FLP problems with respect to changes of centers of fuzzy parameters. He showed that the solution to these problems is stable under variations in the membership function of the fuzzy coefficients. In this paper, we generalize the concept of sensitivity analysis on the parameters of the crisp linear programming  to the fuzzy number linear programming and show that the fuzzy primal simplex algorithm stated in  and the fuzzy dual simplex algorithm presented in  would be useful for post optimality analysis on linear programming problems with fuzzy numbers. The rest of this paper is organized as follows: In Section 2, we give some necessary concepts of fuzzy set theory as well as a review of the fuzzy number linear programming problem and it’s dual problem. We review the fuzzy simplex algorithms to solve the fuzzy number linear programming problems in Section 3 and then explain them by several illustrative examples. The fuzzy simplex algorithms are used for sensitivity analysis in Section 4. Finally, we conclude in Section 5.
نتیجه گیری انگلیسی
In this paper, based on fuzzy simplex algorithms for solving fuzzy number linear programming and using the general linear ranking functions on fuzzy numbers, we generalized a concept of sensitivity analysis in FNLP problems. We emphasize that the proposed method cannot solve FNLP problems when the variables are also fuzzy numbers. This will be an interesting research work in the future.