This article proposes a new ranking method for ordering Triangular Intuitionistic Fuzzy Number (TIFN) based on area of both membership and nonmembership parts of the number. Firstly, the membership part is split into two regions. Then the area between the midpoints of the centroids of the membership part is calculated to order the TIFN. Later on, the same procedure is adopted to calculate the a...

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplexmethod. But their computational complexities are exponential, which is not satisfactory for solving largescale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programmi...

We study the parallelization of the steepest-edge version of the dual sim-plex algorithm. Three diierent parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...

In most practical problems of linear programming problems with fuzzy cost coefficients, some or all variables are restricted to lie within lower and upper bounds. In this paper, the authors propose a new method for solving such problems called the bounded fuzzy primal simplex algorithm. Some researchers used the linear programming problem with fuzzy cost coefficients as an auxiliary problem for...

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

This paper proposes a hybrid computational method (DIPS method) which works as a simplex method for solving a standard form linear program, and, simultaneously, as an interior point method for solving its dual. The DIPS method generates a sequence of primal basic feasible solutions and a sequence of dual interior feasible solutions interdependently. Along the sequences, the duality gap decrease...