Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/157419
Authors: 
Dey, Partha Pratim
Pramanik, Surapati
Giri, Bibhas C.
Year of Publication: 
2014
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 10 [Year:] 2014 [Pages:] 173-184
Abstract: 
The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multiobjective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ideal solution (NIS). In the proposed approach, first, the PIS and NIS for both levels are determined and the membership functions of distance functions from PIS and NIS of both levels are formulated. Linearization technique is used in order to transform the nonlinear membership functions into equivalent linear membership functions and then normalize them. A possible relaxation on decision for both levels is considered for avoiding decision deadlock. Then fuzzy goal programming models are developed to achieve compromise solution of the problem by minimizing the negative deviational variables. Distance function is used to identify the optimal compromise solution. The paper presents a hybrid model of TOPSIS and fuzzy goal programming. An illustrative numerical example is solved to clarify the proposed approach. Finally, to demonstrate the efficiency of the proposed approach, the obtained solution is compared with the solution derived from existing methods in the literature.
Subjects: 
Bi-level programming
Fuzzy goal programming
Linear fractional bi-level multi-objective decision making
Multi-objective decision making
TOPSIS
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/2.0/
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.