............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these Answer : a. Critical path...
An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these Answer : c. Both a and b...
The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b Answer : b. A travelling salesman problem...
The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above Answer : d. All the above...
In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these Answer : a. Profit...
50.5k questions
47.1k answers
240 comments
7.0k users