Test: Transportation & Assignment Model - Mechanical Engineering MCQ
10 questions mcq test - test: transportation & assignment model, which of the following is needed to use the transportation model.
Capacity of the sources
Demand of the destinations
Unit shipping cost
All of these
Which method usually gives a very good solution to the assignment problem?
Northwest corner rule
Vogel's approximation method
MODI method
Stepping-stone method
In applying Vogel’s approximation method to a profit maximation problem, row and column penalties are determined by
finding the largest unit cost in each row or column.
finding the sum of the unit costs in each row or column.
finding the difference between the two highest unit costs in each row and column.
finding the difference between the two lowest unit costs in each row and column.
The concept of Vogel’s Approximation Method can be well understood through an illustration given below :
The difference between two least cost cells are calculated for each row and column, which can be seen in the iteration given for each row and column.
Which one of the following is riot the solution method of transportation method?
Hungarian method
North west corner method
Least cost method
Vogel’s approximate method
The matrix in assignment model is
square maxtrix
rectangular matrix
diagonal matrix
unit matrix
Assignment model can be solved by conventional linear programming approach or transportation model approach, it is square matrix, having equal number of rows and columns. The objective is to assign one item from row to one item from column so that total cost of assignement is minimum.
In order for a transportation matrix which has six rows and four columns not to degenerate, what is the number of occupied cells, in the matrix?
Number of cells for non-degenerate solution = 6 + 4 - 1 = 9
Consider the following statements: 1. For the application of optimally test in case of transportation model, the number of allocations should be equal to (m + n) where m is the number of rows and n is the number of columns. 2. Transportation problem is a special case of a linear programming problem. 3. In case of assignment problem, the first step is to dummy row or a matrix by adding a dummy row or a dummy column.
Which of these statements is/are correct?
1 and 2 only
2 and 3 only
Consider the following statements on transportation problem: 1. In Vogel’s approximation method, priority allotment is made in the cell with the lowest cost. 2. The North-west corner method ensures faster optimal solution. 3. If the total demand is higher than the supply, transportation problem cannot be solved. 4. A feasible solution may not be an optimal solution.
Which of these statements are correct?
Penalty cost method is
North West corner method
Vogel’s approximation method
None of the above
One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that
it is complicated to use
it does not ’take into account cost of transportation
it leads to a degenerate initial solution
all of the above
Top Courses for Mechanical Engineering
Important Questions for Transportation & Assignment Model
Transportation & assignment model mcqs with answers, online tests for transportation & assignment model, welcome back, create your account for free.
Forgot Password
Have an account?
Transportation and Assignment Problem
Mathematics.
5 questions
Introducing new  Paper mode
No student devices needed. Â Know more
The north- west corner rule is used to find
Initial feasible solution
An optimum solution
Non- optimum solution
None of these
An assignment problem is a
Non- integer programming problem
Integer programming problem
Transportation problem
Which is true for assignment problem?
The number of rows equals the number of columns
All circled values in a stone are one
All rim requirements are one
All are true
In a balanced transportation problem with m origins and n destinations the number of linearly independent constraints is
In an unbalanced transportation problem with m- sources and n- destinations the number of basic variables is
Explore all questions with a free account
Continue with email
Continue with phone
Problem Questions with Answer, Solution | Operations Research - Exercise 10.1: Transportation Problem | 12th Business Maths and Statistics : Chapter 10 : Operations Research
Chapter: 12th business maths and statistics : chapter 10 : operations research, exercise 10.1: transportation problem.
Exercise 10.1
1. What is transportation problem?
2. Write mathematical form of transportation problem.
3. what is feasible solution and non degenerate solution in transportation problem?
4. What do you mean by balanced transportation problem?
5. Find an initial basic feasible solution of the following problem using north west corner rule.
6. Determine an initial basic feasible solution of the following transportation problem by north west corner method
7. Obtain an initial basic feasible solution to the following transportation problem by using least- cost method.
8. Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem
9. Consider the following transportation problem
Determine initial basic feasible solution by VAM
10. Determine basic feasible solution to the following transportation problem using North west Corner rule.
11. Find the initial basic feasible solution of the following transportation problem:
Using (i) North West Corner rule
(ii) Least Cost method
(iii) Vogel’s approximation method
12. Obtain an initial basic feasible solution to the following transportation problem by north west corner method.
Related Topics
Privacy Policy , Terms and Conditions , DMCA Policy and Compliant
Copyright © 2018-2024 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.
View all MCQs in
No comments yet
Related MCQs
- An assignment problem is considered as a particular case of a transportation problem because
- An assignment problem is a special case of transportation problem, where
- A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is
- Using the transportation simplex method, the optimal solution to the transportation problem has been found when
- To use the transportation simplex method, a transportation problem that is unbalanced requires the use of
- An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
- Which of the following is used to come up with a solution to the assignment problem?
- Which method usually gives a very good solution to the assignment problem?
- The optimal solution is found in an assignment matrix when the minimum number of straight lines needed to cover all the zeros equals
- In the general linear programming model of the assignment problem,
IMAGES
VIDEO
COMMENTS
Transportation and assignment Multiple Choice Questions. Operations research (OR) is an analytical method of problem-solving and decision-making that is useful. Skip to document. University; ... In a transportation problem where the demand or requirement is equal to the available resource is known as ( a) Balanced transportation problem, ...
Transshipment problem formulation may be used in place of transportation formulation when there are two products that are being shipped, each having its own per unit cost of shipping. A) True: B) False: 6: In a linear programming formulation of the assignment problem, the RHS of all constraints is greater than 1. A) True: B) False: 7
An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is: A. positive & greater than zero. B. positive with at least one equal to zero. C. negative with at least one equal to zero. D.
Figure 8: Constructing a transportation problem 4.3.2 Mathematical model of a transportation problem Before we discuss the solution of transportation problems we will introduce the notation used to describe the transportation problem and show that it can be formulated as a linear programming problem. We use the following notation; x
Q-Chat. Get a hint. The problem which deals with the distribution of goods from several sources to several destinations is the a. maximal flow problem b. transportation problem c. assignment problem d. shortest-route problem. Click the card to flip 👆. b. transportation problem. Click the card to flip 👆. 1 / 52.
In this video i have discussed some mcqs on transportation and assignment problems. In every mcq options have been eliminated with justification and numerica...
Terms in this set (12) Transportation problem. a special type of linear programming problem where the objective consists in minimising transportation cost. assignment problem. a specialized form of an optimization model that attempts to assign limited capacity to various demand points in a way that minimizes costs. Ways to transport goods.
Transportation and Assignment Problems. 1. Multiple Choice. finding the smallest unit cost in each row or column. finding the sum of the unit costs in each row or column. finding the difference between the two lowest unit costs in each row and column. finding the difference between the two highest unit costs in each row and column.
Get Transportation Model Multiple Choice Questions (MCQ Quiz) with answers and detailed solutions. ... stocked for sale or the are in process of manufacturing or in the form of material yet to be utilized is known as an assignment problem. ... For m × n transportation problem solution is called non-degenerate when the following two conditions ...
Short Cut Tricks and Tips to solve the MCQ related to Transportation Problems.See the below full playlist of Optimization Techniques: https://www.youtube.com...
7. Identify the relationship between assignment problems and transportation problems. 8. Formulate a spreadsheet model for an assignment problem from a description of the problem. 9. Do the same for some variants of assignment problems. 10. Give the name of an algorithm that can solve huge assignment problems that are well
Identify the relationship between assignment problems and transportation problems. Formulate a spreadsheet model for an assignment problem from a description of the problem. Do the same for some variants of assignment problems. Give the name of an algorithm that can solve huge assignment problems that are well beyond the scope of Solver.
2 only. Test: Transportation & Assignment Model - Question 8. Save. Consider the following statements on transportation problem: 1. In Vogel's approximation method, priority allotment is made in the cell with the lowest cost. 2. The North-west corner method ensures faster optimal solution.
1 pt. An assignment problem is a. Non- integer programming problem. Integer programming problem. Transportation problem. None of these. 3. Multiple Choice. Edit.
8. Explain Vogel's approximation method by obtaining initial feasible solution of the following transportation problem . 9. Consider the following transportation problem. Determine initial basic feasible solution by VAM . 10. Determine basic feasible solution to the following transportation problem using North west Corner rule. 11.
We are given a transportation problem with m suppliers and n demanders where the amount of the supplies equals the amount of demands. A collection of m+n-1 circled cells is optimal if the indicator value associated with each of those empty cells is positive. If some indicator cells are positive and some are zero, there are multiple solutions ...
Transportation, Transshipment, and Assignment Problems Learning Objectives After completing this chapter, you should be able to: Describe the nature of transportation transshipment and assignment problems. Formulate a transportation problem as a linear programming model. Use the transportation method to solve problems with Excel.
Get Assignment Multiple Choice Questions (MCQ Quiz) with answers and detailed solutions. Download these Free Assignment MCQ Quiz Pdf and prepare for your upcoming exams Like Banking, SSC, Railway, UPSC, State PSC. ... Transportation problems are used for meeting the demand and supply requirements under the given condition in the most optimum ...
Related MCQs. The assignment problem is a special case of transportation problem in which _____. The transportation problem deals with the transportation of _____. Maximization assignment problem is transformed into a minimization problem by_____. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are
total supply must equal total demand in the transportation problem: B. ... Related MCQs. An assignment problem is considered as a particular case of a transportation problem because An assignment problem is a special case of transportation problem, where A solution to a transportation problem that has less than m + n − 1 cells with positive ...