Solving a Fully Fuzzy Linear Programming Problem by Ranking
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 9, Issue 2
Abstract
In this paper, we propose a new method for solving Fully Fuzzy linear programming Problem (FFLP) using ranking method .In this proposed ranking method, the given FFLPP is converted into a crisp linear programming (CLP) Problem with bound variable constraints and solved by using Robust’s ranking technique and the optimal solution to the given FFLP problem is obtained and then compared between our proposed method and the existing method. Numerical examples are used to demonstrate the effectiveness and accuracy of this method.
Authors and Affiliations
P. Rajarajeswari , A. Sahaya Sudha ,
Keywords
Related Articles
- EP ID EP94250
- DOI -
- Views 103
- Downloads 0
Magic and Bimagic Labeling for Disconnected Graphs
An edge magic total labeling of a graph G V E ( , ) with p vertices and q edges is a bijection f from the set of vertices and edges to 1,2,..., p q such that for every edge uv in E, f u f uv f v ( ) ( ) ( ) ...
Characterizations of k-normal matrices
In this paper to extend and generalize lists of characterizations of k-normal and k-hermitian matrices known in the literature, by providing numerous sets of equivalent conditions referring to the notions of co...
Reflection and Transmission of Elastic Waves at the Loosely Bonded Solid-Solid Interface
Reflection and transmission phenomenon of plane waves at a loosely bonded interface between linear isotropic elastic solid half space and fluid saturated incompressible porous solid half space is studied in the present s...
On Strongly Multiplicative Graphs
A graph G with p vertices and q edges is said to be strongly multiplicative if the vertices are assigned distinct numbers 1, 2, 3, …, p such that the labels induced on the edges by the product of the end vertices a...
Some Results on Super Harmonic Mean Graphs
Let G be a graph with p vertices and q edges. Let f: V(G) → {1, 2, …, p + q} be a injective function. For a vertex labeling f, the induced edge labeling f∗(e = uv) is defined by f∗(e) = ⌈(2f(u)f(v))/(f(u)+ f(v))⌉ or ⌊(2f...