To the best of our knowledge till now there is no method in the literature to find the exact fuzzy optimal solution of unbalanced fully fuzzy transportation problems. In this paper, the shortcomings and limitations of some of the existing methods for solving the problems are pointed out and to overcome these shortcomings and limitations, two new methods are proposed to find the exact fuzzy optimal solution of unbalanced fuzzy transportation problems by representing all the parameters as LR flat fuzzy numbers. To show the advantages of the proposed methods over existing methods, a fully fuzzy transportation problem which may not be solved by using any of the existing methods, is solved by using the proposed methods and by comparing the results, obtained by using the existing methods and proposed methods. It is shown that it is better to use proposed methods as compared to existing methods.

In the last few years, a lot of researchers have proposed different methods, to solve the mathematical programming problem of matrix games with Atanassov's intuitionistic fuzzy payoffs. In this paper, the flaws of the existing methods for solving matrix games with Atanassov's intuitionistic fuzzy payoffs (matrix games in which payoffs are represented by Atanassov's intuitionistic fuzzy numbers) are pointed out. Also, to resolve these flaws, new methods (named as Ambika methods) are proposed to obtain the optimal strategies as well as minimum expected gain of Player I and maximum expected loss of Player II for matrix games with Atanassov's intuitionistic fuzzy payoffs. To illustrate proposed Ambika methods, some existing numerical problems of matrix games with Atanassov's intuitionistic fuzzy payoffs are solved by proposed Ambika methods.

To the best of our knowledge, there is only one approach for solving neutrosophic cost minimization transportation problems. Since neutrosophic transportation problems are a new area of research, other researchers may be attracted to extend this approach for solving other types of neutrosophic transportation problems like neutrosophic solid transportation problems, neutrosophic time minimization transportation problems, neutrosophic transshipment problems, and so on. However, after a deep study of the existing approach, it is noticed that a mathematical incorrect assumption has been used in these existing approaches; therefore there is a need to modify these existing approaches. Keeping the same in mind, in this paper, the existing approach is modified. Furthermore, the exact results of some existing transportation problems are obtained by the modified approach.