Fuzzy linear programming problems : models and solutions

We investigate various types of fuzzy linear programming problems based on models and solution methods. First, we review fuzzy linear programming problems with fuzzy decision variables and fuzzy linear programming problems with fuzzy parameters (fuzzy numbers in the definition of the objective function or constraints) along with the associated duality results. Then, we review the fully fuzzy linear programming problems with all variables and parameters being allowed to be fuzzy. Most methods used for solving such problems are based on ranking functions, alpha-cuts, using duality results or penalty functions. In these methods, authors deal with crisp formulations of the fuzzy problems. Recently, some heuristic algorithms have also been proposed. In these methods, some authors solve the fuzzy problem directly, while others solve the crisp problems approximately

A Novel Technique for Solving Multiobjective Fuzzy Linear Programming Problems

This study considers multiobjective fuzzy linear programming (MFLP) problems in which the coefficients in the objective functions are triangular fuzzy numbers. The study proposing a new technique to transform MFLP problems into the equivalent single fuzzy linear programming problem and then solving it via linear ranking function using the simplex method, supported by numerical example

Lexicographic Methods for Fuzzy Linear Programming

Fuzzy Linear Programming (FLP) has addressed the increasing complexity of real-world decision-making problems that arise in uncertain and ever-changing environments since its introduction in the 1970s. Built upon the Fuzzy Sets theory and classical Linear Programming (LP) theory, FLP encompasses an extensive area of theoretical research and algorithmic development. Unlike classical LP, there is not a unique model for the FLP problem, since fuzziness can appear in the model components in different ways. Hence, despite fifty years of research, new formulations of FLP problems and solution methods are still being proposed. Among the existing formulations, those using fuzzy numbers (FNs) as parameters and/or decision variables for handling inexactness and vagueness in data have experienced a remarkable development in recent years. Here, a long-standing issue has been how to deal with FN-valued objective functions and with constraints whose left- and right-hand sides are FNs. The main objective of this paper is to present an updated review of advances in this particular area. Consequently, the paper briefly examines well-known models and methods for FLP, and expands on methods for fuzzy single- and multi-objective LP that use lexicographic criteria for ranking FNs. A lexicographic approach to the fuzzy linear assignment (FLA) problem is discussed in detail due to the theoretical and practical relevance. For this case, computer codes are provided that can be used to reproduce results presented in the paper and for practical applications. The paper demonstrates that FLP that is focused on lexicographic methods is an active area with promising research lines and practical implications.Spanish Ministry of Economy and CompetitivenessEuropean Union (EU) TIN2017-86647-

A Constructive Proof of Fundamental Theory for Fuzzy Variable Linear Programming Problems

Two existing methods for solving fuzzy variable linear programming problems based on ranking functions are the fuzzy primal simplex method proposed by Mahdavi-Amiri et al. (2009) and the fuzzy dual simplex method proposed by Mahdavi-Amiri and Nasseri (2007). In this paper, we prove that in the absence of degeneracy these fuzzy methods stop in a finite number of iterations. Moreover, we generalize the fundamental theorem of linear programming in a crisp environment to a fuzzy one. Finally, we illustrate our proof using a numerical example

Solving fully neutrosophic linear programming problem with application to stock portfolio selection

Neutrosophic set is considered as a generalized of crisp set, fuzzy set, and intuitionistic fuzzy set for representing the uncertainty, inconsistency, and incomplete knowledge about the real world problems. In this paper, a neutrosophic linear programming (NLP) problem with single-valued trapezoidal neutrosophic numbers is formulated and solved. A new method based on the so-called score function to find the neutrosophic optimal solution of fully neutrosophic linear programming (FNLP) problem is proposed. This method is more flexible than the linear programming (LP) problem, where it allows the decision maker to choose the preference he is willing to take. A stock portfolio problem is introduced as an application. Also, a numerical example is given to illustrate the utility and practically of the method

Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as the feasibility degree of constrains, and then transform the fuzzy objective into two crisp objectives by considering expected value and uncertainty of fuzzy objective. Since the feasibility degree of constrains is in conflict with the optimal value of objective function, we finally construct an auxiliary three-objective linear programming problem, which is solved through a compromise programming approach, to solve the initial FFLP problem. To illustrate the proposed method, two numerical examples are solved

Solving fully fuzzy linear programming problems by controlling the variation range of variables

This paper deals with a fully fuzzy linear programming problem (FFLP) in which the coefficients of decision variables, the right-hand coefficients and variables are characterized by fuzzy numbers. A method of obtaining optimal fuzzy solutions is proposed by controlling the left and right sides of the fuzzy variables according to the fuzzy parameters. By using fuzzy controlled solutions, we avoid unexpected answers. Finally, two numerical examples are solved to demonstrate how the proposed model can provide a better optimal solution than that of other methods using several ranking functions

Fuzzy Efficiency Measures in Data Envelopment Analysis Using Lexicographic Multiobjective Approach

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.There is an extensive literature in data envelopment analysis (DEA) aimed at evaluating the relative efficiency of a set of decision-making units (DMUs). Conventional DEA models use definite and precise data while real-life problems often consist of some ambiguous and vague information, such as linguistic terms. Fuzzy sets theory can be effectively used to handle data ambiguity and vagueness in DEA problems. This paper proposes a novel fully fuzzified DEA (FFDEA) approach where, in addition to input and output data, all the variables are considered fuzzy, including the resulting efficiency scores. A lexicographic multi-objective linear programming (MOLP) approach is suggested to solve the fuzzy models proposed in this study. The contribution of this paper is fivefold: (1) both fuzzy Constant and Variable Returns to Scale models are considered to measure fuzzy efficiencies; (2) a classification scheme for DMUs, based on their fuzzy efficiencies, is defined with three categories; (3) fuzzy input and output targets are computed for improving the inefficient DMUs; (4) a super-efficiency FFDEA model is also formulated to rank the fuzzy efficient DMUs; and (5) the proposed approach is illustrated, and compared with existing methods, using a dataset from the literature

Solving fully fuzzy linear programming problems by controlling the variation range of variables

This paper deals with a fully fuzzy linear programming problem (FFLP) in which the coefficients of decision variables, the right-hand coefficients and variables are characterized by fuzzy numbers. A method of obtaining optimal fuzzy solutions is proposed by controlling the left and right sides of the fuzzy variables according to the fuzzy parameters. By using fuzzy controlled solutions, we avoid unexpected answers. Finally, two numerical examples are solved to demonstrate how the proposed model can provide a better optimal solution than that of other methods using several ranking functions

Predicting the optimal solution in fuzzy linear programming problem

In this paper we try to define a percentage form of LR fuzzy numbers which is a useful form of fuzzy numbers and its’ arithmetics. So, we show how the maximum variation range of optimal value of fuzzy objective function can be predicted by using this form of fuzzy numbers. Since fuzzy problems are generally solved through a complicated manner, the purpose of this study is releasing a kind of prediction for the final solution in the way that the manager can access to an outlook to optimal solution (Z∗) without solving the problem. Finally, optimal value of fuzzy objective function on fuzzy linear programming is predicted whenmaximum variation range of fuzzy variable have been predetermined