-
1.Transportation problem is a special class of __________.
a. LPP.
b. assignment problem.
c. none of the two.
d. both 1 and 2.
2.The Objective function of Transportation problem is to________.
a. maximize the total cost.
b. minimize or maximize the total cost.
c. minimize the total cost.
d. total cost should be zero.
3. In Transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is _____________.
a. north west corner rule.
b. least cost method.
c. Vogel’s approximation method.
d. simplex method .
4.In Transportation problem the improved solution of the initial basic feasible solution is called ___________.
a. basic solution .
b. optimal solution.
c. degenerate solution.
d. non-degenerate solution.
5.In Transportation problem optimal solution can be verified by using ________.
a. north west corner rule.
b. least cost method .
c. MODI method.
d. matrix method .
6.The cells in the Transportation problem can be classified as ________.
a. assigned cells and empty cells .
b. allocated cells and un allocated cells.
c. occupied and unoccupied cells .
d. assigned and unoccupied cells.
7.In North west corner rule the allocation is done in ________.
a. upper left corner.
b. upper right corner.
c. middle cell in the transportation table.
d. cell with the lowest cost.
8.In Least cost method the allocation is done by selecting ___________.
a. upper left corner.
b. upper right corner.
c. middle cell in the transportation table.
d. cell with the lowest cost.
9.In Transportation problem is said to be balanced if ________.
a. total supply is not equal to total demand .
b. total supply is greater than total demand.
c. total supply is lesser than total demand.
d. total supply is equal to total demand .
10.In Transportation problem is said to be unbalanced if _________.
a. total supply is not equal to total demand .
b. total supply is greater than total demand.
c. total supply is lesser than total demand.
d. total supply is equal to total demand .
1: A. 2:C. 3:C. 4:B. 5:C. 6:C. 7:A. 8:D. 9:D. 10:A.
11.In a transportation problem, items are allocated from sources to destinations
a. at a maximum cost
b. at a minimum cost
c. at a minimum profit
d. at a minimum revenue12.The basic feasible solution to a transportation problem is said to be optimal if it __________________.
a. maximizes or minimizes the transportation cost.
b.maximizes the transportation cost.
c. minimizes the transportation cost.
d. has degenerate solution.
13.The necessary and sufficient condition for the existence of a feasible solution to a transportation problem is a solution that satisfies all the conditions of_________.
a. Supply.
b. Demand.
c. supply and demand.
d. either supply or demand.
14. Purpose of MODI method is to get__________.
a. degenerate solution.
b. non-degenerate solution.
c. Optimal.
d. basic feasible solution.
15.In transportation problem the solution is said to non-degenerate solution if occupied cells is __________.
a. greater than m+n-1.
b. lesser than m+n-1.
c. greater than or equal to m+n-1.
d. lesser than or equal to m+n-1.
16.In transportation problem the solution is said to degenerate solution if occupied cells is____________.
a. greater than m+n-1.
b. lesser than m+n-1.
c. greater than or equal to m+n-1.
d. lesser than or equal to m+n-1.
17.In transportation problem if total supply > total demand we add _________.
a. dummy row with cost0.
b. dummy column with cost0.
c. dummy row with cost1.
d. dummy column with cost1.
18.In transportation problem if total supply < total demand we add __________.
a. dummy row with cost0.
b. dummy column with cost0.
c. dummy row with cost1.
d. dummy column with cost1.
19.In North west corner rule if the demand in the column is satisfied one must move to the ___________.
a. left cell in the next column.
b. right cell in the next row.
c. right cell in the next column.
d. left cell in the next row.
20.In North west corner rule if the supply in the row is satisfied one must move _____________.
a. down in the next row.
b. up in the next row.
c. right cell in the next column.
d. left cell in the next row.
21.Maximization case in transportation problem the objective is to __________.
a. maximize the total profit.
b. minimize the total loss .
c. neither maximize nor minimize.
d. optimal cost.
22.In Maximization case in transportation problem we convert into minimization by subtracting all the elements from the ___________.
a. Zero.
b. One.
c. highest element.
d. lowest element.
11: B. 12:C. 13:C. 14:C. 15:B. 16:C. 17:B. 18:A. 19:C. 20:A. 21:A. 22:C.
sources: https://brainmass.com/business/business-management/50-multiple-choice-questions-on-quantitative-methods-69857- https://www.slideshare.net/akshaygavate1/ds-mcq
https://wps.prenhall.com/
1 .In Graphical solution the feasible region is_____________. a. where all the constraints are satisfied simultaneously. b. any one constraint is satisfied. c. only the first constraint is satisfied. d. any one of the above conditions. 2 .Some case in LPP has _________. a. one optimal solutions. b. two optimal solutions. c. three. d. multiple optimal solution. 3 .An LPP deals with problems involving only_________. a. single objective. b. multiple objectives. c. two objective. d. none of these. 4 .Which of the following is not associated with any LPP_____________. a. feasible solution. b. optimum solution. c. deterministic in nature. d. Quadratic equation. 5 .The graphical method can be used when an LPP has ______ decision variables. a. 2 b. 3 c. 4 d. more than 4 6 .Which method is used to get optimal solution in graphical method of solv
Comments
Post a Comment