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 169
- Downloads 0
Effect of Shadow of the Earth Due to Solar Radiation Pressure, Magnetic Force and Earth’s Oblateness on the Non-Linear Oscillation of the System in a Circular Orbit of the Centre of Mass of the Systems
We have studied the non-linear oscillation of the system of the satellites connected by light, flexible and extensible cable under the influence of magnetic force, the shadow of the earth due to solar radiation pressure...
On gr*-Closed Sets in a Topological Spaces
The aim of this paper is to introduce the concept of generalized regular star closed sets and study some of its properties.
A Regression Model to Investigate the Performance of Black-Scholes using Macroeconomic Predictors
As it is well known an option is defined as the right to buy sell a certain asset, thus, one can look at the purchase of an option as a bet on the financial instrument under consideration. Now while the evaluation of opt...
The Relation between Language and Science, Technology, and Mathematics in Nigerian Schools
The study focuses on importance of language proficiency in the learning of science, technology and mathematics (STM) with attention given to the review of research studies on language and STM within the context o...
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...