OPERATIONSRESEARCH Total points 19/20
Multiple Choice Questions (MCQs)
VII SEM CIVIL ENGG
1. _________are the entities whose values are to be determined from the 1/1
solution of the LPP
(a) Objective function
(b) Decision Variables
(c) Constraints
(d) Artificial Variable
2. are the restrictions or limitations imposed on the LPP.
(a) Variables
(b) Costs
( c) Profits
(d) Constraints
3. When the feasible region is such that the value of objective function can 0/1
extend to infinity, it is called a case of__________
(a) Infeasiblesolution
(b) Alternate optimal
(c) Unboundedsolution
(d) Unique solution
Correct answer
(a) Infeasiblesolution
4. In a transportation problem, the method of penalties is called 1/1
method.
(a) least cost
(b) South-east corner
(c) Vogel’s approximation
(d) north-west corner
5. When the allocations of a transportation problem satisfy the rim 1/1
condition (m + n – 1) the solution is called solution.
(a) degenerate
(b) infeasible
(c) unbounded
(d) non-degenerate
6. The method of solution of assignment problems is called__________ 1/1
(a) NWCR
(b) VAM
(c) LCM
(d) Hungarian
7. The extra row or column which is added to balance an assignment 1/1
problem is called
(a) regret
(b) epsilon
(c) dummy
(d) extra
7. A situation in a game where, in the payoff matrix, maximin of row is 1/1
equal to minimax of column is called .
(a) centre point
(b) main point
(c) saddle point
(d) equal point
8. If in an assignment problem, number of rows is not equal to number of 1/1
columns then .
(a) Problem is degenerate
(b) Problem is unbalanced
(c) It is a maximization problem
(d) Optimal solution is not possible
9. The time required by each job on each machine is called time. 1/1
(a) elapsed
(b) idle
(c) processing
(d) average
10. The participants in a game are called . 1/1
(a) clients
(b) members
(c) customers
(d) players
11. The outcome of the interaction of selected strategies of opponents in a 1/1
game is called .
(a) income
(b) profit
(c) payoff
(d) gains
12. In a game, the alternatives or courses of action available to each player 1/1
are called
(a) options
(b) choices
(c) actions
(d) strategies
13. The longest path in the network diagram is called path. 1/1
(a) best
(b) worst
(c) sub-critical
(d) critical
14. When a maximization assignment problem is converted in 1/1
minimization problem, the resulting matrix is called
(a) Costmatrix
(b) Profit matrix
(c) Regret matrix
(d) Dummymatrix
15. The variable added to the LHS of a less than or equal to constraint to 1/1
convert it into equality is called .
(a) surplusvariable
(b) artificial variable
(c) slackvariable
(d) additional variable
16. The intersection value of key column and key row is called 1/1
(a) vital element
(b) important element
(c) key element
(d) basic element
17. The out going variable row in the simplex algorithm is called 1/1
(a) out going row
(b) key row
(c) interchanging row
(d) basic row
18. The region of feasible solution in LPP graphical method is called . 1/1
(a) Infeasible region
(b) Unboundedregion
(c) Infinite region
(d) Feasible region
19. A basic solution which also satisfies the condition in which all basic 1/1
variables are non ‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
(a) Basic feasible solution
(b) Feasible solution
(c) Optimal solution
(d) None of the above
20. An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible 1/1
solutions
(a) Worst
(b) Best
(c) Ineffective
(d) None of the above
This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy
Does this form look suspicious? Report
Forms
