scholarly journals A Novel Method for Solving the Fully Fuzzy Bilevel Linear Programming Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Aihong Ren
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Level Sets ◽  
Fuzzy Numbers ◽  
Main Idea ◽  
Bilevel Linear Programming ◽  
Decision Variables ◽  
Upper Level

We address a fully fuzzy bilevel linear programming problem in which all the coefficients and variables of both objective functions and constraints are expressed as fuzzy numbers. This paper is to develop a new method to deal with the fully fuzzy bilevel linear programming problem by applying interval programming method. To this end, we first discretize membership grade of fuzzy coefficients and fuzzy decision variables of the problem into a finite number ofα-level sets. By usingα-level sets of fuzzy numbers, the fully fuzzy bilevel linear programming problem is transformed into an interval bilevel linear programming problem for eachα-level set. The main idea to solve the obtained interval bilevel linear programming problem is to convert the problem into two deterministic subproblems which correspond to the lower and upper bounds of the upper level objective function. Based on theKth-best algorithm, the two subproblems can be solved sequentially. Based on a series ofα-level sets, we introduce a linear piecewise trapezoidal fuzzy number to approximate the optimal value of the upper level objective function of the fully fuzzy bilevel linear programming problem. Finally, a numerical example is provided to demonstrate the feasibility of the proposed approach.

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 Linear Programming Problems with Grey Data

2018 ◽  
Vol 3 (1) ◽  
pp. 17-23 ◽  
Author(s):  
Michael Gr. Voskoglou
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Problem ◽  
Standard Method ◽  
Linear Programming Problem ◽  
Real Life ◽  
Optimal Solution ◽  
Real Numbers ◽  
Decision Variables ◽  
Linear Programming Problems

A Grey Linear Programming problem differs from an ordinary one to the fact that the coefficients of its objective function and / or the technological coefficients and constants of its constraints are grey instead of real numbers. In this work a new method is developed for solving such kind of problems by the whitenization of the grey numbers involved and the solution of the obtained in this way ordinary Linear Programming problem with a standard method. The values of the decision variables in the optimal solution may then be converted to grey numbers to facilitate a vague expression of it, but this must be strictly checked to avoid non creditable such expressions. Examples are also presented to illustrate the applicability of our method in real life applications.

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 A comparative study on interval arithmetic operations with intuitionistic fuzzy numbers for solving an intuitionistic fuzzy multi–objective linear programming problem

2017 ◽  
Vol 27 (3) ◽  
pp. 563-573 ◽  
Author(s):  
Rajendran Vidhya ◽  
Rajkumar Irene Hepzibah
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Optimization Method ◽  
Arithmetic Operations ◽  
Intuitionistic Fuzzy Numbers ◽  
Multi Objective ◽  
Intuitionistic Fuzzy ◽  
Interval Valued

AbstractIn a real world situation, whenever ambiguity exists in the modeling of intuitionistic fuzzy numbers (IFNs), interval valued intuitionistic fuzzy numbers (IVIFNs) are often used in order to represent a range of IFNs unstable from the most pessimistic evaluation to the most optimistic one. IVIFNs are a construction which helps us to avoid such a prohibitive complexity. This paper is focused on two types of arithmetic operations on interval valued intuitionistic fuzzy numbers (IVIFNs) to solve the interval valued intuitionistic fuzzy multi-objective linear programming problem with pentagonal intuitionistic fuzzy numbers (PIFNs) by assuming differentαandβcut values in a comparative manner. The objective functions involved in the problem are ranked by the ratio ranking method and the problem is solved by the preemptive optimization method. An illustrative example with MATLAB outputs is presented in order to clarify the potential approach.

scholarly journals Ranking Function Application for Optimal Solution of Fractional programming problem

2020 ◽  
Vol 25 (1) ◽  
Author(s):  
Rasha Jalal
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Fractional Programming ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Ranking Function ◽  
Linear Fractional Programming ◽  
Fractional Programming Problem ◽  
Linear Programming Problems

The aim of this paper is to suggest a solution procedure to fractional programming problem based on new ranking function (RF) with triangular fuzzy number (TFN) based on alpha cuts sets of fuzzy numbers. In the present procedure the linear fractional programming (LFP) problems is converted into linear programming problems. We concentrate on linear programming problem problems in which the coefficients of objective function are fuzzy numbers, the right- hand side are fuzzy numbers too, then solving these linear programming problems by using a new ranking function. The obtained linear programming problem can be solved using win QSB program (simplex method) which yields an optimal solution of the linear fractional programming problem. Illustrated examples and comparisons with previous approaches are included to evince the feasibility of the proposed approach.

scholarly journals Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Aihong Ren
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Function Method ◽  
Optimal Solution ◽  
Ranking Function ◽  
Objective Functions ◽  
Bilevel Linear Programming ◽  
Fuzzy Optimal Solution ◽  
Deviation Degree

This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.

scholarly journals Linear Programming and Fuzzy Optimization to Substantiate Investment Decisions in Tangible Assets

Entropy ◽  
2020 ◽  
Vol 22 (1) ◽  
pp. 121
Author(s):  
Marcel-Ioan Boloș ◽  
Ioana-Alexandra Bradea ◽  
Camelia Delcea
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Hybrid Model ◽  
Fuzzy Numbers ◽  
Investment Decision ◽  
Fuzzy Optimization ◽  
Simplex Algorithm ◽  
Fuzzy Variables ◽  
Decision Variables ◽  
Tangible Assets

This paper studies the problem of tangible assets acquisition within the company by proposing a new hybrid model that uses linear programming and fuzzy numbers. Regarding linear programming, two methods were implemented in the model, namely: the graphical method and the primal simplex algorithm. This hybrid model is proposed for solving investment decision problems, based on decision variables, objective function coefficients, and a matrix of constraints, all of them presented in the form of triangular fuzzy numbers. Solving the primal simplex algorithm using fuzzy numbers and coefficients, allowed the results of the linear programming problem to also be in the form of fuzzy variables. The fuzzy variables compared to the crisp variables allow the determination of optimal intervals for which the objective function has values depending on the fuzzy variables. The major advantage of this model is that the results are presented as value ranges that intervene in the decision-making process. Thus, the company’s decision makers can select any of the result values as they satisfy two basic requirements namely: minimizing/maximizing the objective function and satisfying the basic requirements regarding the constraints resulting from the company’s activity. The paper is accompanied by a practical example.

scholarly journals Calculating Fuzzy Inverse Matrix Using Linear Programming Problem: An Improved Approach

2021 ◽  
pp. 983-996
Author(s):  
Fatemeh Babakordi ◽  
Nemat Allah Taghi-Nezhad
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Equation System ◽  
Matrix Inverse ◽  
Fuzzy Matrix ◽  
Linear Equation System ◽  
The Matrix ◽  
Left And Right

Calculating the matrix inverse is a key point in solving linear equation system, which involves complex calculations, particularly  when the matrix elements are  (Left and Right) fuzzy numbers. In this paper, first, the method of Kaur and Kumar for calculating the matrix inverse is reviewed, and its disadvantages are discussed. Then, a new method is proposed to determine the inverse of  fuzzy matrix based on linear programming problem. It is demonstrated that the proposed method is capable of overcoming the shortcomings of the previous matrix inverse. Numerical examples are utilized to verify the performance and applicability of the proposed method.

scholarly journals Modeling of Gauss Elimination Technique and AHA Simplex Algorithm for Multi-objective Linear Programming Problems

2020 ◽  
pp. 1-14
Author(s):  
Sanjay Jain ◽  
Adarsh Mangal
Keyword(s):  
Linear Programming ◽  
Numerical Solution ◽  
Objective Function ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Simplex Algorithm ◽  
Multi Objective ◽  
Linear Objective Function ◽  
Gauss Elimination ◽  
Linear Programming Problems

In this research paper, an effort has been made to solve each linear objective function involved in the Multi-objective Linear Programming Problem (MOLPP) under consideration by AHA simplex algorithm and then the MOLPP is converted into a single LPP by using various techniques and then the solution of LPP thus formed is recovered by Gauss elimination technique. MOLPP is concerned with the linear programming problems of maximizing or minimizing, the linear objective function having more than one objective along with subject to a set of constraints having linear inequalities in nature. Modeling of Gauss elimination technique of inequalities is derived for numerical solution of linear programming problem by using concept of bounds. The method is quite useful because the calculations involved are simple as compared to other existing methods and takes least time. The same has been illustrated by a numerical example for each technique discussed here.

Sign in / Sign up

Export Citation Format

Share Document