a) To determine the critical path, we need to find the longest path in the project network.

We can do this
by finding the earliest start and finish times for each activity.

Activity | ES | EF | LS | LF | Slack

A|0|3|0|3|0

B|3|8|3|8|0

C | 3 | 10 | 3 | 10 | 0

D | 8 | 18 | 8 | 18 | 0

E | 10 | 15 | 10 | 15 | 0

F | 18 | 22 | 18 | 22 | 0

The critical path is the path with zero slack, which is A -> C -> E -> F. The critical activities are those that
are on the critical path, which are A, C, E, and F. The project completion time is the duration of the
critical path, which is 22 weeks.

(b) To calculate the earliest start and latest start times for each activity, we use the following formulas:

ES = max{EF of all immediate predecessors}

LS = LF - duration

Activity | ES | EF | LS | LF | Slack

A|0|3|0|3|0

B|3|8|3|8|0

C | 3 | 10 | 8 | 15 | 5

D | 8 | 18 | 8 | 18 | 0

E | 10 | 15 | 15 | 20 | 5

F | 18 | 22 | 18 | 22 | 0
The earliest start time for activity A is 0, since it has no predecessors. The earliest start time for activity B
is the maximum of the earliest finish times of its immediate predecessor activity A, which is 3. The
earliest start time for activity C is the maximum of the earliest finish times of its immediate predecessor
activity A, which is 3. The latest start time for activity A is also 0, since it is a starting activity and has no
successors. The latest start time for activity B is the difference between its latest finish time 8 and its
duration 5, which is 3. The latest start time for activity C is the difference between its latest finish time 15
and its duration 7, which is 8. The latest start time for activity D is the same as its earliest start time 8,
since it is on the critical path. The latest start time for activity E is the difference between its latest finish
time 20 and its duration 5, which is 15. The latest start time for activity F is the same as its earliest start
time 18, since it is on the critical path.

2.

Let's denote the arrival rate lambda as 10/8 hours = 1.25 per hour, and the mean service time mu as 30
minutes or 0.5 hours.

(i) The expected number of units in the system, which includes both those being serviced and those
waiting in the queue, can be calculated as:

L = lambda * W,

where W is the expected time spent by a unit in the system.

To calculate W, we can use Little's Law:

W = L / lambda + mu,

where mu is the mean service time.

Substituting for lambda and mu, we get:

We can also use the fact that the system is in steady state, so the rate of arrivals must equal the rate of
departures:

lambda = mu * (Ls + Lq),

where Ls is the expected number of units being serviced and Lq is the expected number of units waiting
in the queue.

Substituting for lambda and mu and rearranging, we get:

Ls + Lq = lambda / mu * W = (1.25 / 0.5) * (L / 1.25 + 0.5) = 2.5L + 2.5.

We can also use Little's Law to relate Ls and Lq to the expected time spent in the queue, Wq:

Lq = lambda * Wq,

Ls = lambda * Ws,

where Ws is the expected time spent being serviced.

Substituting into our equation for Ls + Lq, we get:

lambda * (Wq + Ws) = 2.5L + 2.5,

1.25 * (Wq + 0.5) = 2.5L + 2.5,

Wq = 2L - 0.5.
Finally, we can use Little's Law to find L:

L = lambda * W = 1.25 * (2L + 2) = 2.5L + 2.5,

0.5L = 2.5,

L = 5.

Therefore, the expected number of units in the system is 5.

(ii) To find the expected number of units in the queue, we can use the formula we derived earlier:

Lq = lambda * Wq = 1.25 * (2L - 0.5) = 2.5

Therefore, the expected number of units in the queue is 2.5.

(iii) To find the probability of the repairman being idle, we can use the Poisson distribution:

P(0 arrivals in 8 hours) = e^(-lambda8) * (lambda8)^0 / 0! = e^(-10) = 0.000045.

Therefore, the probability of the repairman being idle is approximately 0.000045 or 0.0045%.

3.

To solve this game, we need to find the optimal strategies for both players A and B.

We will start by finding the optimal strategy for player B. We can calculate the expected payoff for each
column, assuming that player A plays each row with equal probability:
Column I: (-2)(1/4) + 3(1/4) + (-4)(1/4) + 5(1/4) = 0.5

Column II: 0(1/4) + 2(1/4) + (-3)(1/4) + 3(1/4) = 0.5

Column III: 0(1/4) + 1(1/4) + 0(1/4) + (-4)(1/4) = -0.75

Column IV: 5(1/4) + 2(1/4) + (-2)(1/4) + 2(1/4) = 1.75

Column V: 3(1/4) + 2(1/4) + 6(1/4) + (-6)(1/4) = 1.25

Therefore, player B should choose column IV to maximize their expected payoff, and their optimal
strategy is to play column IV.

Next, we will find the optimal strategy for player A. We can calculate the expected payoff for each row,
assuming that player B plays column IV:

Row I: 5(1/4) + 3(1/4) = 2

Row II: 2(1/4) + 2(1/4) = 1

Row III: -2(1/4) + 6(1/4) = 1

Row IV: 2(1/4) + (-6)(1/4) = -1

Therefore, player A should choose row I to maximize their expected payoff, and their optimal strategy is
to play row I.

The value of the game is the expected payoff when both players play their optimal strategies. From the
calculations above, we see that the expected payoff is 2, so the value of the game is 2.

Therefore, the optimal strategy for player B is to play column IV and the optimal strategy for player A is
to play row I, and the value of the game is 2.
EOQ = √[(2AD)/H]

where A is the annual demand, D is the ordering cost per order, and H is the holding cost per item per
unit of time (in this case, per month).

(i) Using the given values, we have:

A = 12000 units per year

D = Rs. 100 per order

H = Rs. 0.80 per item per month = Rs. 9.60 per item per year (since there are 12 months in a year)

Substituting these values into the EOQ formula, we get:

EOQ = √[(2 x 12000 x 100) / 9.60] = √(250000) = 500

Therefore, the economic order quantity is 500 units.

(ii) To find the time between orders, we need to divide the annual demand by the EOQ and then convert
the result into a time unit. In this case, since the demand is given in units per year and we want the time
between orders in months, we get:

Time between orders = (A / EOQ) x (12 / 1) = (12000 / 500) x 12 = 288 months

Therefore, the time between orders is 288 months, or 24 years.

(iii) To find the number of orders per year, we need to divide the annual demand by the EOQ:
Number of orders per year = A / EOQ = 12000 / 500 = 24

Therefore, the number of orders per year is 24.