A transportation problem consists of 3 sources and 5 destinations with appropriate rim conditions. The number of possible solutions is
- 15
- 225
- 6435
- 150
Answer (Detailed Solution Below)
Option 3 : 6435
Free
CT 1: Ratio and Proportion
10 Questions 16 Marks 30 Mins
Concept:
In a transportation problem if,
Number of sources = m
Number of destinations = n
∴ Number of variable, k = m × n
Number of equations, l = m + n - 1
Calculation:
Given,
Number of sources = 3
Number of destinations = 5
∴ Number of variable, k = m × n = 3 × 5 = 15
Number of equations, l = m + n - 1 = 3 + 5 - 1 = 7
∴ Total number of alternate solution \(= {}_{}^{15}{C_7} = \frac{{15!}}{{7!8!}} = 6435\)
Last updated on Oct 11, 2022
The last date to apply for the GATE ME 2023 Exam has been extended to 7th October 2022 without a late fee and till 14th October 2022 with a late fee. The Indian Institute of Technology (IIT) Kanpur has released the official notification for the GATE ME 2023. The written examination of the Graduate Aptitude Test in Engineering for ME (Mechanical Engineer) is scheduled to take place on 4th February, 5th February, 11th February, and 12th February 2023 and the result for the exam will be announced on 16th March 2023. Candidates who want a successful selection can refer to the GATE ME Preparation Tips to boost their exam preparation and increase their chances of selection.
Related Papers
The study in this paper is to discuss the limitation of Vogel’s Approximation Method (VAM) and developed an improved algorithm after resolving this limitation for solving transportation problem. Vogel’s Approximation Method (VAM) is the more efficient algorithm to solve the transportation problem but it has some limitations when highest penalty cost appear in two or more row or column. For that case VAM does not give any logical solution. In this paper we stand a logical approach for this problem and developed an algorithm named by "Logical Development of Vogel’s Approximation Method (LD-VAM)" where feasible solution from this method are very close to optimal solution more than VAM.
In the field of operations research, modelling of transportation problem is fundamental in solving most real life problems as far optimization is concerned. It is clear that a lot more effort has been put in by many researchers in seek of appropriate solution methods to such problem. Vogel’s Approximation Method (VAM), among the class of algorithms provided to solve the Initial Basic Feasible Solution (IBFS) proved to be best. Likewise is the Modified Distribution Method in testing the optimality of the IBFS. However, for some time now, manual calculations and LINDO are the tools used by most researchers in the application of these efficient proposed techniques. In this work, an equivalent MATLAB program was written that would aid in the computation of such problems with ease especially when the problem at hand has a larger cost matrix.
We investigate global optimality of a recent method – the Direct Exponential Approach (DEA) – for minimizing transportation cost. The DEA method is implemented on a balanced and an unbalanced transportation model and results are compared with the MODI method –the widely accepted optimal solution method. The presented comparison outlines the cases where DEA method fails to be optimal. It is finally recommended to use the DEA method as only a basic feasible solution method, instead of an optimal solution method, for minimizing the transportation cost.
Transportation Algorithm uses for solving Transportation Problem to find feasible solution which may optimal or not. This is now a challenge that developed such an algorithm which gives optimal solution without using Optimality Methods like as MODI, Stepping-Stone. For this reason there are several transportation algorithm exists for solving TP like as North West Corner Rule (NWC), Least Cost Method (LCM), Vogel’s Approximation Method (VAM) etc. where VAM provides the feasible solution which is lower than NWC and LCM and for some case of TP it coincides with optimal solution. In this paper we proposed a new approach named “Implied Cost Method (ICM)” where feasible solutions are lower than VAM and very close to optimal solution or sometimes coincides with optimal solution.
A new method is proposed for solving fuzzy transportation problem, using symmetric trapezoidal number fuzzy with cut and ranking technique by assuming that a decision maker is uncertain about the precise values of the transportation cost, availability and demand of the product. In the proposed method, transportation cost, availability and demand of the product are represented by generalized trapezoidal fuzzy numbers. To illustrate the proposed method, a numerical example is solved and the obtained results are compared with the results of existing methods. Since the proposed method is a direct extension of classical method, the proposed method is very easy to understand and to apply on real life transportation problems for the decision makers.