Solution of Fuzzy Multi-Objective Fractional Linear Programming Problem Using Fuzzy Programming Technique based on Exponential Membership Function
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
A method of solving multi-objective fuzzy fractional linear programming problem (MOFFLPP) is presented. All the coefficients of the fractional multi-objective functions and the constraints are taken to be fuzzy numbers. In this paper a MOFFLPP is first reduced to crisp multi-objective linear programming problem and then the crisp MOLPP is solved by Zimmerman’s technique using exponential membership functions.
Authors and Affiliations
Priyadarsini Rath
Keywords
Related Articles
- EP ID EP531664
- DOI 10.5958/2320-3226.2018.00012.7
- Views 151
- Downloads 0
INDEPENDENT VERIFICATION OF EULER’S FORMULA IN GRAPH THEORY FOR N IDENTICAL CIRCLES
This paper discusses the famous Euler’s formula in graph theory and its independent verification for the case of n identical circles forming a planar graph. A planar connected graph is generated using n circles, and an i...
ON FUNCTIONS OF A SINGLE MATRIX ARGUMENT - III
We prove some Eulerian integrals involving the hypergeometric functions of single matrix argument. The integrals studied here involve the and the functions of matrix argument. We apply the Mathai’s matrix transform t...
Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors
Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic pict...
Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.
Two Finite Simple Directed Graphs
The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclusion to draw from this result is that f...