Operations Research Set 1
On This Page
This set of Operations Research Multiple Choice Questions & Answers (MCQs) focuses on Operations Research Set 1
Q1 | ________are entities whose value is determined from the solution of LPP
- objective function
- decision variable
- constraints
- opportunity cost
Q2 | The region of feasible solution in LPP graphical method is called ____
- infeasible region
- unbounded region
- infinite region
- feasible region
Q3 | The outgoing variable row in the simplex table is called ____
- outgoing row
- key row
- basic row
- interchanging row
Q4 | When the solution is degenerate in transportation problem, we add a _
- dummy
- epsilon
- penalty
- regret
Q5 | ______method is used in Assignment Problem
- ncwr
- lcm
- vam
- hungarian
Q6 | The longest path in the network diagram is called ____
- head path
- sub path
- critical path
- sub critical path
Q7 | IF the Minimax are ( 10,18,16) and Maximin are (8,10,7). The saddle point is ___
- 7
- 10
- 18
- 8
Q8 | Pick the wrong relationship:
- interfering float = total float – free float
- total float =free float + independent float
- total float ≥ free float ≥ independent float
- free float = total float – head event slack
Q9 | The shortest time in the PERT is called ______time
- expected
- pessimitic
- optimistic
- most likely
Q10 | The total time required to complete all the jobs in a job sequence problem is known as ______
- processing order
- idle time
- processing time
- elapsed time
Q11 | Operations Research Models in which values of all variables and all possible outcomes are known with certainty are called models.
- physical
- symbolic
- deterministic
- probabilistic
Q12 | Operations Research Models in which some or all variables are random in nature are called models.
- physical
- symbolic
- deterministic
- probabilistic
Q13 | and are techniques applied in project management.
- cpm and pert
- assignment & transportation
- game theory
- decision theory& inventory models
Q14 | are the entities whose values are to be determined from the solution of the LPP.
- objective function
- decision variables
- constraints
- opportunity cost
Q15 | specifies the objective or goal of solving the LPP.
- objective function
- decision variables
- constraints
- opportunity cost
Q16 | _are the restrictions or limitations imposed on the LPP.
- objective function
- variables
- constraints
- profit
Q17 | When it is not possible to find solution in LPP, it is called as solution
- infeasible
- unbounded
- improper
- unknown
Q18 | In case of a ‘ ’ constraint, the feasible region is a straight line.
- less than or equal to
- greater than or equal to
- mixed
- equal to
Q19 | In linear programming, unbounded solution means solution.
- infeasible
- infinite
- unique
- degenerate
Q20 | The incoming variable column in the simplex algorithm is called .
- key column
- incoming column
- important column
- variable column
Q21 | The intersection value of key column and key row is called
- vital element
- important element
- basic element
- key element
Q22 | The variable added to the LHS of a less than or equal to constraint to convert it into equality is called variable.
- surplus
- artificial
- slack
- additional
Q23 | A resource which is completely utilized is called in simplex
- null resource
- scarce resource
- abundant resource
- zero resource
Q24 | In simplex, a minimization problem is optimal when all Delta J, i.e. Cj – Zj values are .
- either zero or positive
- either zero or negative
- only positive
- only negative
Q25 | To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called method
- vogel’s approximat ion method
- nwcr
- lcm
- modi