Scribd
Upload
29 views2 pages

Operation Research Questions Bank

The document contains a question bank for operational research, featuring objective questions related to assignment and transportation problems, along with practical questions requiring the application of various methods to find initial basic feasible solutions. It includes true/false statements about methods and concepts such as Vogel's approximation and the MODI method. Additionally, it provides practical problems to solve using different techniques like the North-west Corner Rule and Least Cost Method.

Uploaded by

lohakaredinesh69
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Operation Research Questions Bank

The document contains a question bank for operational research, featuring objective questions related to assignment and transportation problems, along with practical questions requiring the application of various methods to find initial basic feasible solutions. It includes true/false statements about methods and concepts such as Vogel's approximation and the MODI method. Additionally, it provides practical problems to solve using different techniques like the North-west Corner Rule and Least Cost Method.

Uploaded by

lohakaredinesh69
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Operational research Question Bank

Objective Questions
1) If there are multiple optimal solutions, the optimal function to be minimised/maximised will
have corresponding different optimal values. False
2) If the assignment elements are profit elements, then the objective of the optimal assignment
is to maximize the profit. True
3) Vogel's approximation method is used to find Test of Optimality of a transportation problem.
False
4) MODI method is used to test the optimality of a given feasible solution. True
5) If the assignment elements are cost elements, then the objective of the optimal assignment is
to maximise the cost. False
6) An unbalanced assignment problem can be converted into a balanced one by adding dummy
rows/columns. True
7) The dummy activity has an expected Cost of zero by definition. True
8) If in an assignment problem, number of rows is not equal to number of columns then
problems is unbalanced. True
9) MODI method is used to find Initial Basic feasible solution. False
10) If the assignment elements are cost elements, then the objective of the optimal assignment is
to minimise the cost. True
11) Vogel's approximation method is used to find feasible solution of a transportation problem. True
12) When a solution has less than m + n - 1 allocations the solution is optimal. False
13) If in a transportation problem, number of rows is not equal to number of columns, then the
problem is unbalanced. False
14) Regret matrix is made to convert a maximisation problem into minimisation problem in
assignment. True
15) If an assignment problem contains some cases where an assignment cannot be made to a
particular cell, it is unbalanced problem. False
16) If the assignment elements are cost elements, then the objective of the optimal assignment is
to maximize the cost. False
17) Regret matrix is made to convert a minimisation problem into maximisation problem in
assignment. False
18) A basic requirement for using the transportation techniques is that the problem must be
balanced. False
19) Vogel's approximation method is based on the concept of a break- even point. False
20) An assignment problem can be solved by simplex method. True

Short note:-
1) Opportunity Loss Martix/ Regret Matrix
2) Balanced Assignment Problem
3) Unbalanced Assignment Problem
4) Prohibited Assignment Problem
5) Balanced Transportation Problem
6) Unbalanced Transportation Problem
7) Prohibited Transportation Problem
8) Optimum solution in Transportation Problem
Practical Questions

1) Find initial basic feasible for the following transportation problem using North-west
Corner Rule:
Source Destination
D1 D2 D3 D4 D5 Availability
S1 4 2 7 5 5 1100
S2 3 4 6 5 6 900
S3 7 3 3 5 5 700
Requirement 800 400 500 400 600 2700

2) Solve the following transportation problem by finding the initial basic feasible solution using
Lowest Cost Entry Method. Cost Matrix
Origin Destination
D1 D2 D3 D4 Availability
O1 6 7 6 9 30
O2 8 8 7 6 50
O3 9 7 10 14 20
Requirement 20 40 30 10
3) Find initial basic feasible for the following transportation problem using Matrix Minima Method:
Source Destination
D1 D2 D3 D4 D5 Availability
S1 4 2 7 5 5 1100
S2 3 4 6 5 6 900
S3 7 3 3 5 5 700
Requirement 800 400 500 400 600 2700
4) Solve the following transportation problem by finding the initial basic feasible solution
using Least Cost Method. Cost Matrix
Destination
Factory D1 D2 D3 Availability
F1 2 4 7 50
F2 5 1 6 20
F3 9 8 2 40
Demand 60 10 40 110
5) What are the various methods to finding an Initial feasible solution to a transportation
problems?
6) Explain the algorithm of Hungarian method to solve the Assignment problem?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy