A method for solving fuzzy goal programming problems based on MINMAX approach

作     者：Yaghoobi, M. A. Tamiz, M. 

作者机构：Univ Portsmouth Dept Math Portsmouth PO1 3HE Hants England Univ Kerman Fac Math & Comp Sci Kerman Iran 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (欧洲运筹学杂志)

年 卷 期：2007年第177卷第3期

页      面：1580-1590页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Ministry of Science Research and Technology  MSRT 

主　　题：fuzzy goal programming goal programming fuzzy programming MINMAX approach 

摘      要：Narasimhan incorporated fuzzy set theory within goal programming formulation in 1980. Since then numerous research has been carried out in this field. One of the well-known models for solving fuzzy goal programming problems was proposed by Hannan in 1981. In this paper the conventional MINMAX approach in goal programming is applied to solve fuzzy goal programming problems. It is proved that the proposed model is an extension to Hannan model that deals with unbalanced triangular linear membership functions. In addition, it is shown that the new model is equivalent to a model proposed in 1991 by Yang et al. Moreover, a weighted model of the new approach is introduced and is compared with Kim and Whang s model presented in 1998. A numerical example is given to demonstrate the validity and strengths of the new models. (c) 2005 Elsevier B.V. All rights reserved.