and that the three demand constraints also sum up to this same expression. It follows that it is sufficient to work with any subset of 5 out of these 6 equations. To understand what this means more explicitly, suppose we are given a proposed solution to the original equations, and we are asked to check whether or not the given solution is feasible. To answer this, we would have to substitute th...

There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...

there are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. the first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. t...

Minimizing transportation time and getting optimal solutions are always considered as important factors while solving problem. This paper shows a new approach for finding initial basic solution problem which reduces cost of more than any method such LCM, northwest, Vogel’s approximation so on. has been illustrated by taking an example; afterwards, it compares feasible with other methods IBF dic...

Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.