A multi-objective linear programming problem is made from fuzzy problem. It due the fact that it used method during solution. The Multi objective can be converted into single function by various methods as Chandra Sen’s method, weighted sum ranking statistical averaging method. In this paper, and both are here for making function. Two problems solved to verify result. One numerical example othe...

This paper presents a new phase 1 simplex algorithm for solving linear programming problems. In the algorithm, first, the equation with the auxiliary objective function at the optimality as a new constraint is added to phase 1, and then a pivot is performed to generate one vertex on the associated objective hyperplane. This vertex may be feasible or not feasible. If it is feasible, the phase 1 ...

A geometrical analysis is made of the dual simplex algorithm applied to a linear programming formulation of the one-center location problem in IR (2) using block distance. A geometric rule is given, and shown to be equivalent to the minimum ratio rule of the simplex algorithm, for updating the dual basis. The geometric analysis is applied to the Euclidean distance one-center problem and yields ...

In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with hesitant fuzzy linguistic information. Then, motivated by the idea of traditional arithmetic operation, we have developed some aggregation operators for aggregating hesitant fuzzy linguistic information: hesitant fuzzy linguistic weighted average (...

In paper the fuzzy linear system d x C x A ~ ~ ~   where A and C are crisp matrices and n m  d~ is a LR fuzzy numbers vector, is investigated in detail. We generalize the definition and arithmetic operations of LR fuzzy numbers and convert the dual fuzzy linear system to two crisp systems of linear equations. Then the minimal fuzzy solution of the original fuzzy system is obtained by solving...

The Random-Facet algorithm is a randomized variant of the simplex method which is known to solve any linear program with n variables and m constraints using an expected number of pivot steps which is subexponential in both n and m. This is the theoretically fastest simplex algorithm known to date if m ≈ n; it provably beats most of the classical deterministic variants which require exp(Ω(n)) pi...

FUZZY LINEAR PROGRAMMING USING MULTIATTRIBUTE VALUE FUNCTION Masahiro INUIGUCHI Hidetomo ICHIHASHI Hideo TANAKA University of Osaka Prefecture In this paper, a fuzzy linear programming problem is formulated under the assumption that a multiattribute value function is given, and its method of solution is proposed. The fuzzy linear programming problem in this paper is the unconstrained linear pro...

In this paper, assuming cooperative behavior of the decision makers, solution methods for decisionmaking problems in hierarchical organizations under fuzzy randomenvironments are considered. To deal with the formulated two-level linear programming problems involving fuzzy random variables, α-level sets of fuzzy random variables are introduced and an α-stochastic two-level linear programming pro...

The purpose of the paper is to study how to solve a type of matrix games with payoffs of triangular fuzzy numbers. In this paper, the value of a matrix game with payoffs of triangular fuzzy numbers has been considered as a variable of the triangular fuzzy number. First, based on two auxiliary linear programming models of a classical matrix game and the operations of triangular fuzzy numbers, fu...