The Organizers wants to devise a task time policy such that the total time to the participants to reach treasure is minimized. The policy should also ensure that not more than 70 per cent of the total traffic passes through junction B. The time taken by the participants travelling from point S to point T under this policy will be:

7 hours

No worries! We‘ve got your back. Try BYJU‘S free classes today!

9 hours

No worries! We‘ve got your back. Try BYJU‘S free classes today!

10 hours

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

10 hours

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C
10 hours

There must be one other route other than those involving B with the least cost as most only 70% participants can only use this route.
We must take S-D-C-T as the other route.
S-B-C-T, if task time at B = 3, total time= 10.
S-D-C-T, if task time at D and C is 0, total time is 10.
$∴$ 10 hours is the least time.

Suggest Corrections

Similar questions

Q. The organizers want to devise a task time policy such that the total time for the participants to reach the treasure is minimized. The policy should also ensure that not more than 70 per cent of the total traffic passes through junction B. The time taken by the participants in travelling from point S to point T under this policy will be:

If the organizers wants to ensure that no participant should travel on the street from D to T, while equal number of participants should travel through junctions A and C, then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:

Q. If the organizers want to ensure that all participants travelling from S to T take the same time (travelling time and task time combined) regardless of the route they choose and the street from B to C is under repairs (and hence unusable), then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:

If the Organizers want to ensure that all participants travelling from S to T take the same time (travelling time and task time combined) regardless of the route they choose and the street from B to C is under repairs (and hence unusable), then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:

If the Organizers wants to ensure that all routes from S to T get the same number of participants, then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:

Join BYJU'S Learning Program