On fuzzy goal programming procedure to bi-level multiobjective linear fractional programming problems (Q2627832)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On fuzzy goal programming procedure to bi-level multiobjective linear fractional programming problems
scientific article

    Statements

    On fuzzy goal programming procedure to bi-level multiobjective linear fractional programming problems (English)
    0 references
    0 references
    31 May 2017
    0 references
    Summary: In this paper, we propose an alternate modified solution procedure based on fuzzy goal programming (FGP) approach for solving bi-level multiobjective linear fractional programming problems (BL-MOLFPPs) with some major modifications in the algorithm suggested by \textit{M. A. Abo-Sinna} and \textit{I. A. Baky} [Int. J. Math. Math. Sci. 2010, Article ID 148975, 15 p. (2010; Zbl 1263.90081)]. The proposed modified technique is simpler and requires less computational works than that of earlier technique. In the formulation of FGP models, each objective function (at both the levels - leader's level and follower's level) as well as control variables (of leader's level) are transformed into fuzzy goals with modified membership functions. Then FGP approach is used for achieving the highest degree of each of membership goals. To avoid decision deadlock situations and difficulties associated with bi-level programming problems, solution preferences by decision makers (at leader's and follower's levels) are not taken into account in proposed algorithm. A comparative analysis is also carried out with numerical example in order to show efficiency of proposed algorithm over earlier technique.
    0 references
    0 references
    0 references
    0 references
    0 references
    bi-level MOLFPP
    0 references
    multiobjective linear fractional programming problem
    0 references
    BL-MOLFPP
    0 references
    fuzzy goal programming
    0 references
    FGP
    0 references
    membership function
    0 references
    compromise optimal solution
    0 references
    0 references