Modified FGP approach for multi-level multi objective linear fractional programming problems

Kailash Lachhwani

doi:10.1016/j.amc.2015.06.027

Return

Modified FGP approach for multi-level multi objective linear fractional programming problems

2015-09-01

PRE

Kailash Lachhwani *

DOI：10.1016/j.amc.2015.06.027

Original

Original request for help

Save

Abstract

En 中文

In this paper, we present a new modified method for solving multi-level multi objective linear fractional programming problems (ML-MOLFPPs) based on fuzzy goal programming (FGP) approach with some modifications in the algorithm suggested by Baky (2010) [18] which dealt with multi-level multi objective linear programming problem (ML-MOLPP). In proposed modified approach, numerator and denominator function of each objective at each level are individually transformed into fuzzy goals and their aspiration levels are determined using individual best solutions. Different linear membership functions are defined for numerator and denominator function of each objective function. Then highest degree of each of these membership goals is achieved by minimising the sum of negative deviational variables. The proposed algorithm simplifies the ML-MOLFPP by eliminating solution preferences by the decision makers at each level, thereby avoiding difficulties associate with multi-level programming problems and decision deadlock situations. The aim of this paper is to present simple and efficient technique to obtain compromise optimal solution of ML-MOLFP problems. Numerical examples are illustrated in order to support the proposed modified FGP technique. (C) 2015 Elsevier Inc. All rights reserved.

Keywords:

Multi-level multi objective linear fractional programming problem

Fuzzy goal programming

Compromise optimal solution

Membership function

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.