Operations Research Set 2
On This Page
This set of Operations Research Multiple Choice Questions & Answers (MCQs) focuses on Operations Research Set 2
Q1 | When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
- infeasible solution
- feasible solution
- optimum solution
- degenerate solution
Q2 | When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called
- infeasible solution
- feasible solution
- non degenerate solution
- degenerate solution
Q3 | Which of the following considers difference between two least costs for each row and column while finding initial basic feasible solution in transportation?
- vam
- nwcr
- modi
- lcm
Q4 | If the number of rows and columns in an assignment problem are not equal than it is called problem.
- balanced
- unbalanced
- infeasible
- unbounded
Q5 | The method used for solving an assignment problem is called method.
- vam
- nwcr
- modi
- hungarian
Q6 | When a maximization assignment problem is converted in minimization problem, the resulting matrix is called matrix.
- cost
- regret
- profit
- dummy
Q7 | The longest path in the network diagram is called path
- critical
- sub-critical
- best
- worst
Q8 | Backward pass calculations are done to find occurrence times of events.
- tentative
- definite
- latest
- earliest
Q9 | The order in which machines are required for completing the jobs is called
- machines order
- job order
- processing order
- working order
Q10 | The time during which a machine remains waiting or vacant in sequencing problem is called time.
- processing
- waiting
- free
- idle
Q11 | In linear programming represents mathematical equation of the limitations imposed by the problem.
- objective function
- decision variables
- constraints
- opportunity cost
Q12 | The type of constraint which specifies maximum capacity of a resource is ‘or equal to’ constraint.
- less than
- greater than
- not greater than
- not less than
Q13 | The region of feasible solution in LPP graphical method is called region
- infeasible
- infinite
- unbounded
- feasible
Q14 | When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having .
- multiple constraints
- infinite constraints
- infeasible constraints
- mixed constraints
Q15 | The outgoing variable row in the simplex algorithm is called .
- outgoing row
- key row
- interchanging row
- basic row
Q16 | A resource which is partially utilized is called in simplex.
- null resource
- scarce resource
- abundant resource
- zero resource
Q17 | The value of one extra unit of resource is called in simplex.
- unit price
- extra price
- retail price
- shadow price
Q18 | In simplex, a maximization 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
Q19 | In a transportation problem, the method of penalties is called method.
- vogel’s approximat ion method
- nwcr
- lcm
- modi
Q20 | When there is a degeneracy in the transportation problem, we add an imaginary allocation called in the solution.
- dummy
- penalty
- regret
- epsilon
Q21 | If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number of columns)
- there is no degeneracy
- degeneracy exists
- solution is optimum
- problem is balanced
Q22 | An activity whose start or end cannot be delayed without affecting total project completion time is called activity.
- dummy
- non-critical
- important
- critical
Q23 | Floats for critical activities will be always be .
- one
- zero
- highest
- equal to duration
Q24 | The shortest possible completion time of an activity in PERT is called time.
- optimistic
- pessimistic
- expected
- most likely
Q25 | The total time required to complete all the jobs in a job sequencing problem is known as .
- processing time
- waiting time
- elapsed time
- idle time