The problem resulting from a goal programming problem with linear fractional criteria is not easy to solve due to the non-linear constraints inherent in its formulation. This paper introduces a simple and reliable test to establish whether a linear fractional goal programming problem has solutions that verify all goals and, if so, how to find them by solving a linear programming problem. This p...

In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...

This paper considers Stackelberg solutions for decision making problems in hierarchical organizations under fuzzy random environments. Taking into account vagueness of judgments of decision makers, fuzzy goals are introduced into the formulated fuzzy random two-level linear programming problems. On the basis of the possibility and necessity measures that each objective function fulfills the cor...

In this paper, a multi-objective intuitionistic fuzzy linear fractional programm ing problem is discussed with two different methods namely Kanti Swarup’s Fractional algorithm and weighting factor method in which the constraints are triangular intuitionistic fuzzy number. The optimal solutions are verified for the proposed methods. Numerical examples are provided to check the feasibility of the...

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 ...

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a finite number of extreme points and the denominator part of each of the objec...