Fully Fuzzy Linear Programming Problem with Triangular Fuzzy Numbers

2016 ◽  
Vol 13 (7) ◽  
pp. 4036-4041 ◽  
Author(s):  
Qiumei Liu ◽  
Xin Gao
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Fuzzy Linear Programming ◽  
Triangular Fuzzy Numbers

A new approach to solve fully intuitionistic fuzzy linear programming problem with unrestricted decision variables

2021 ◽  
pp. 1-14
Author(s):  
Manisha Malik ◽  
S. K. Gupta ◽  
I. Ahmad
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Fuzzy Set ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Fuzzy Linear Programming ◽  
Planning Problem ◽  
Intuitionistic Fuzzy Numbers ◽  
Intuitionistic Fuzzy ◽  
Decision Variables

In many real-world problems, one may encounter uncertainty in the input data. The fuzzy set theory fits well to handle such situations. However, it is not always possible to determine with full satisfaction the membership and non-membership degrees associated with an element of the fuzzy set. The intuitionistic fuzzy sets play a key role in dealing with the hesitation factor along-with the uncertainity involved in the problem and hence, provides more flexibility in the decision-making process. In this article, we introduce a new ordering on the set of intuitionistic fuzzy numbers and propose a simple approach for solving the fully intuitionistic fuzzy linear programming problems with mixed constraints and unrestricted variables where the parameters and decision variables of the problem are represented by intuitionistic fuzzy numbers. The proposed method converts the problem into a crisp non-linear programming problem and further finds the intuitionistic fuzzy optimal solution to the problem. Some of the key significance of the proposed study are also pointed out along-with the limitations of the existing studies. The approach is illustrated step-by-step with the help of a numerical example and further, a production planning problem is also demonstrated to show the applicability of the study in practical situations. Finally, the efficiency of the proposed algorithm is analyzed with the existing studies based on various computational parameters.

scholarly journals Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Haifang Cheng ◽  
Weilai Huang ◽  
Jianhu Cai
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Equality Constraints ◽  
Compromise Programming ◽  
Fuzzy Linear Programming ◽  
Programming Approach ◽  
Optimal Value ◽  
Fuzzy Equality

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.

MULTI-OBJECTIVE FULLY FUZZIFIED LINEAR PROGAMMING

2001 ◽  
Vol 09 (05) ◽  
pp. 605-621 ◽  
Author(s):  
JAMES J. BUCKLEY ◽  
THOMAS FEURING ◽  
YOICHI HAYASHI
Keyword(s):  
Linear Programming ◽  
Evolutionary Algorithm ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Solution Procedure ◽  
Fuzzy Linear Programming ◽  
Multi Objective ◽  
Linear Programming Problems ◽  
Single Objective

In this paper we wish to solve multi-objective fully fuzzified linear programming problems which are multi-objective linear programming problems where all the parameters and variables are fuzzy numbers. We change this problem into a single objective fuzzy linear programming problem and then show that our solution procedure can be used to explore the whole undominated set. An evolutionary algorithm is then designed to generate undominated solutions. An example is presented showing our evolutionary algorithm solution.

scholarly journals Solution of Fully Bipolar Fuzzy Linear Programming Models

2021 ◽  
Vol 2021 ◽  
pp. 1-31
Author(s):  
Muhammad Athar Mehmood ◽  
Muhammad Akram ◽  
Majed G. Alharbi ◽  
Shahida Bashir
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Equality Constraints ◽  
Fuzzy Linear Programming ◽  
Mathematical Tool ◽  
Decision Variables ◽  
Crisp Linear Programming

The Yin-Yang bipolar fuzzy set is a powerful mathematical tool for depicting fuzziness and vagueness. We first extend the concept of crisp linear programming problem in a bipolar fuzzy environment based on bipolar fuzzy numbers. We first define arithmetic operations of unrestricted bipolar fuzzy numbers and multiplication of an unrestricted trapezoidal bipolar fuzzy number (TrBFN) with non-negative TrBFN. We then propose a method for solving fully bipolar fuzzy linear programming problems (FBFLPPs) with equality constraints in which the coefficients are unrestricted triangular bipolar fuzzy numbers and decision variables are nonnegative triangular bipolar fuzzy numbers. Furthermore, we present a method for solving FBFLPPs with equality constraints in which the coefficients and decision variables are unrestricted TrBFNs. The FBFLPP is transformed into a crisp linear programming problem, and then, it is solved to achieve the exact bipolar fuzzy optimal solution. We illustrate the proposed methodologies with several numerical examples.

scholarly journals Optimization of LR -Type Fully Bipolar Fuzzy Linear Programming Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-36
Author(s):  
Muhammad Athar Mehmood ◽  
Muhammad Akram ◽  
Majed G. Alharbi ◽  
Shahida Bashir
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Equality Constraints ◽  
Fuzzy Linear Programming ◽  
Numerical Examples ◽  
Linear Programming Problems ◽  
Formula Type ◽  
Crisp Linear Programming

In this study, we present a technique to solve LR -type fully bipolar fuzzy linear programming problems (FBFLPPs) with equality constraints. We define LR -type bipolar fuzzy numbers and their arithmetic operations. We discuss multiplication of LR -type bipolar fuzzy numbers. Furthermore, we develop a method to solve LR -type FBFLPPs with equality constraints involving LR -type bipolar fuzzy numbers as parameters and variables. Moreover, we define ranking for LR -type bipolar fuzzy numbers which transform the LR -type FBFLPP into a crisp linear programming problem. Finally, we consider numerical examples to illustrate the proposed method.

scholarly journals An Integer solution in Intuitionistic Transportation Problem with Application in Agriculture

2017 ◽  
Vol 10 (1) ◽  
pp. 18-23
Author(s):  
M. A Lone ◽  
S. A Mir ◽  
M.S Wani
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Branch And Bound ◽  
Linear Programming Problem ◽  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Special Kind ◽  
Integer Solution ◽  
Branch And Bound Method ◽  
Triangular Fuzzy Numbers

In this paper, we investigate a Transportation problem which is a special kind of linear programming in which profits; supply and demands are considered as Intuitionistic triangular fuzzy numbers. The crisp values of these Intuitionistic triangular fuzzy numbers are obtained by defuzzifying them and the problem is formulated into linear programming problem. The solution of the formulated problem is obtained through LINGO software. If the obtained solution is non-integer then Branch and Bound method can be used to obtain an integer solution.

Sign in / Sign up

Export Citation Format

Share Document