Multi-level Multi-objective Quadratic Fractional Programming Problem with Fuzzy Parameters: A FGP Approach

The motivation behind this paper is to present multi-level multi-objective quadratic fractional programming (ML-MOQFP) problem with fuzzy parameters in the constraints. ML-MOQFP problem is an important class of non-linear fractional programming problem. These type of problems arise in many fields such as production planning, financial and corporative planning, health care and hospital planning. Firstly, the concept of the -cut and fuzzy partial order relation are applied to transform the set of fuzzy constraints into a common crisp set. Then, the quadratic fractional objective functions in each level are transformed into non-linear objective functions based on a proposed transformation. Secondly, in the proposed model, separate non-linear membership functions for each objective function of the ML-MOQFP problem are defined. Then, the fuzzy goal programming (FGP) approach is utilized to obtain a compromise solution for the ML-MOQFP problem by minimizing the sum of the negative deviational variables. Finally, an illustrative numerical example is given to demonstrate the applicability and performance of the proposed approach

A fuzzy goal programming approach to solving decentralized bi-level multi-objective linear fractional programming problems

This paper presents a new approach for solving decentralized bi-level multi-objective linear fractional programming problems. The main goal was to find a simple algorithm with high confidence of decision-makers in the results. First, all the linear fractional programming models on the given set of constraints were solved separately. Next, all the linear fractional objective functions were linearized, membership functions of objective functions and decision variables controlled by decision-makers at the highest level calculated, and a fuzzy multi-objective linear programming model formed and solved as linear goal programming problem by using simplex algorithm. The efficiency of the proposed algorithm was investigated using an economic example, and the obtained results compared with those obtained using an existing method

Fuzzy Goal Programming Procedure to Bilevel Multiobjective Linear Fractional Programming Problems

This paper presents a fuzzy goal programming (FGP) procedure for solving bilevel multiobjective linear fractional programming (BL-MOLFP) problems. It makes an extension work of Moitra and Pal (2002) and Pal et al. (2003). In the proposed procedure, the membership functions for the defined fuzzy goals of the decision makers (DMs) objective functions at both levels as well as the membership functions for vector of fuzzy goals of the decision variables controlled by first-level decision maker are developed first in the model formulation of the problem. Then a fuzzy goal programming model to minimize the group regret of degree of satisfactions of both the decision makers is developed to achieve the highest degree (unity) of each of the defined membership function goals to the extent possible by minimizing their deviational variables and thereby obtaining the most satisfactory solution for both decision makers. The method of variable change on the under- and over-deviational variables of the membership goals associated with the fuzzy goals of the model is introduced to solve the problem efficiently by using linear goal programming (LGP) methodology. Illustrative numerical example is given to demonstrate the procedure

Interactive Bi-Level Multi-Objective Integer Non-linear Programming Problem

Abstract This paper presents a bi-level multi-objective integer non-linear programming (BLMINP) problem with linear or non-linear constraints and an interactive algorithm for solving such model. At the first phase of the solution algorithm to avoid the complexity of non convexity of this problem, we begin by finding the convex hull of its original set of constraints using the cutting-plane algorithm to convert the BLMINP problem to an equivalent bi-level multi-objective non-linear programming (BLMNP) problem. At the second phase the algorithm simplifies an equivalent (BLMNP) problem by transforming it into separate multi-objective decision-making problems with hierarchical structure, and solving it by using ε -constraint method to avoid the difficulty associated with non-convex mathematical programming. In addition, the author put forward the satisfactoriness concept as the first-level decision-maker preference. Finally, an illustrative numerical example is given to demonstrate the obtained results. Mathematics Subject Classification: 90C29; 90C30; 41A58; 90C1