71.
To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are.

72.
The Hungarian method for solving an assignment problem can also be used to solve.

73.
An optimal solution of an assignment problem can be obtained only if.

74.
The objective functions and constraints are linear relationship between _____________.

75.
Assignment problem helps to find a maximum weight identical in nature in a weighted ____________.

76.
All the parameters in the linear programming model are assumed to be ____________.

77.
The solution need not be in ___________ numbers.

78.
Graphic method can be applied to solve a LPP when there are only _____________ variable.

79.
If the feasible region of a LPP is empty, the solution is ______________.

80.
The variables whose coefficient vectors are unit vectors are called ____________.

Read More Section(Operations Research)

Each Section contains maximum 100 MCQs question on Operations Research. To get more questions visit other sections.