In marking assignments, which of the following should be preferred?

Related MCQs

• Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___________.
• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• Which of the following methods is used to verify the optimality of the current solution of the transportation problem_________.
• Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?
• For a salesman who has to visit n cities, following are the ways of his tour plan___.
• An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______.
• The group replacement policy in suitable for identical low cost items which are likely to_________.
• The activity which can be delayed without affecting the execution of the immediate succeeding activity is determined by_________.
• The assignment problem is a special case of transportation problem in which ______.