MCQGeeks
0 : 0 : 1
CBSE
JEE
NTSE
NEET
English
UK Quiz
Quiz
Driving Test
Practice
Games
Quiz
Management
Operations Research
Quiz 4
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
Q.1
The Hungarian method for solving an assignment problem can also be used to solve.
A transportation problem
A travelling salesman problem
A LP problem
Both a & b
Q.2
An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of.
Rows or columns
Rows & columns
Rows + columns – 1
None of the above
Q.3
Operations Research is a ____________.
Science
Art
Mathematics
Both A and B
Q.4
What have been constructed for Operations Research problems and methods for solving the models that are available in many cases?
Scientific Models
Algorithms
Mathematical Models
None of the above
Q.5
Graphic method can be applied to solve a LPP when there are only _____________ variable.
One
More than One
Two
Three
Q.6
If the feasible region of a LPP is empty, the solution is ______________.
Infeasible
Unbounded
Alternative
None of the above
Q.7
The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because.
It improve the total cost
It does not disturb rim conditions
It ensure feasible solution
All of the above
Q.8
When total supply is equal to total demand in a transportation problem, the problem is said to be?
Balanced
Unbalanced
Degenerate
None of the above
Q.9
Which of the following methods is used to verify the optimality of the current solution of the transportation problem?
Least cost method
Vogel’s approximation method
Modified distribution method
All of the above
Q.10
The assignment problem.
Requires that only one activity be assigned to each resource
Is a special case of transportation problem
Can be used to maximize resources
All of the above
Q.11
If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table.
M + n
M – n
3 +m + n
M + n – 1
Q.12
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the _____________.
Constraints
Objective Functions
Both A and B
None of the above
Q.13
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________.
Infeasible
Unbounded
Alternative
None of the above
Q.14
In LPP, degeneracy occurs in ____________ stages.
One
Two
Three
Four
Q.15
Every LPP is associated with another LPP is called ______________.
Primal
Dual
Non_linear programming
None of the above
Q.16
Operations Research uses models built by quantitative measurement of the variables of a given problem and also derives a solution from the model using _____________ of the diversified solution techniques.
Two or more
One or more
Three or more
Only One
Q.17
A solution may be extracted from a model either by.
Conducting experiments on it
Mathematical analysis
Both A and B
Diversified Techniques
Q.18
Which technique is used to imitate an operation prior to actual performance ?
Simulation
Integrated Production Models
Inventory Control
Game Theory
Q.19
An optimal solution of an assignment problem can be obtained only if.
Each row & column has only one zero element
Each row & column has at least one zero element
The data is arrangement in a square matrix
None of the above
Q.20
The objective functions and constraints are linear relationship between _____________.
Variables
Constraints
Functions
All of the above
Q.21
While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to?
Minimize total cost of assignment
Reduce the cost of assignment to zero
Reduce the cost of that particular assignment to zero
All of the above
Q.22
The method used for solving an assignment problem is called.
Reduced matrix method
MODI method
Hungarian method
None of the above
Q.23
The purpose of a dummy row or column in an assignment problem is to.
Obtain balance between total activities & total resources
Prevent a solution from becoming degenerate
Provide a means of representing a dummy problem
None of the above
Q.24
Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost minimization under certain constraints?
Quailing Theory
Waiting Line
Both A and B
Linear Programming
Q.25
The variables whose coefficient vectors are unit vectors are called ____________.
Unit Variables
Basic Variables
Non basic Variables
None of the above
Q.26
The degeneracy in the transportation problem indicates that
Dummy allocation(s) needs to be added
The problem has no feasible solution
The multiple optimal solution exist
a & b but not c
Q.27
An assignment problem is considered as a particular case of a transportation problem because.
The number of rows equals columns
All xij = 0 or 1
All rim conditions are 1
All of the above
Q.28
Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to.
2n+1
2n-1
m+n-1
m+n
Q.29
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
Q.30
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.
m+n
m*n
m+n-1
m+n+1
0 h : 0 m : 1 s
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
Report Question
×
What's an issue?
Question is wrong
Answer is wrong
Other Reason
Want to elaborate a bit more? (optional)
Support mcqgeeks.com by disabling your adblocker.
×
Please disable the adBlock and continue.
Thank you.
Reload page