Q.1
The Hungarian method for solving an assignment problem can also be used to solve.
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.
Q.3
Operations Research is a ____________.
Q.4
What have been constructed for Operations Research problems and methods for solving the models that are available in many cases?
Q.5
Graphic method can be applied to solve a LPP when there are only _____________ variable.
Q.6
If the feasible region of a LPP is empty, the solution is ______________.
Q.7
The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because.
Q.8
When total supply is equal to total demand in a transportation problem, the problem is said to be?
Q.9
Which of the following methods is used to verify the optimality of the current solution of the transportation problem?
Q.10
The assignment problem.
Q.11
If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table.
Q.12
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the _____________.
Q.13
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________.
Q.14
In LPP, degeneracy occurs in ____________ stages.
Q.15
Every LPP is associated with another LPP is called ______________.
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.
Q.17
A solution may be extracted from a model either by.
Q.18
Which technique is used to imitate an operation prior to actual performance ?
Q.19
An optimal solution of an assignment problem can be obtained only if.
Q.20
The objective functions and constraints are linear relationship between _____________.
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?
Q.22
The method used for solving an assignment problem is called.
Q.23
The purpose of a dummy row or column in an assignment problem is to.
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?
Q.25
The variables whose coefficient vectors are unit vectors are called ____________.
Q.26
The degeneracy in the transportation problem indicates that
Q.27
An assignment problem is considered as a particular case of a transportation problem because.
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.
Q.29
One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that.
Q.30
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.
0 h : 0 m : 1 s