Answer 1:

Let the total truckloads between nodes I and J is p I,J. Then we divide p I,J it into two parts:

1. Carried by rented trailers

2. Carried by company’s own trailers

Let’s assume X I, J be the truckloads carried by company’s own trailers

Min Z = ∑ (p I, J - X I, J) r I, J + ∑ X I, J c I, J + ∑ E I, J * WI, J

∑ X I, J + E I, J = ∑ X J, K + E J, K

WI, J  Number of Empty Trailers

Nodes = Drop off points

Arcs basically represent transfer of goods either through rented or company owned trailers

Answer 2:

Let the amount of fuel to be loaded at a station j to be P J and the Consumption of fuel
between airports J and K to be QJ, K The Safety Stock for an airport j+1 is equal to R J+1 The
Maximum Threshold for Take-Off is equal to TJ There are n Airports

Minimize Z = ∑ PJ CJ

Let 1 is the first airport from where the plane departs

then equation satisfying all constraints is:

1. P1 + PN – QN, 1 ≤ T1
2. P1 + PN – QN, 1 - Q1, 2 ≥ R2

Again for Moving between Airports 1 and 2 the Consumption of Fuel is equal to:-

Q1, 2 = α1 + β1 (P1 + PN – QN, 1)

1. P1 + P2 - Q1, 2 + PN – QN, 1 ≤ T2
2. P1 + P2 - Q1, 2 – Q2, 3 + PN – QN, 1 ≥ R3
3. Q2, 3 = α2 + β2 (P1 + P2 - Q1, 2 + PN – QN, 1)

Similarly for nth Airport

The Constraints would be:-

∑ PJ (From J=1 to N) – [∑ QJ, J+1 (From J=1 to N-1)] + PN – QN, 1 ≤ TJ

∑ PJ (From J=1 to N) – [∑ QJ, J+1 (From J=1 to N)] + PN – QN, 1 ≥ RJ+1

QN-1, N = αN-1 + βN-1 (∑ PJ (From J=1 to N) – [∑ QJ, J+1 (From J=1 to N-1)] + PN – QN, 1)

Answer 3:

There are three situations where Plants 1, 2, 3 are shut down one by one because the other
two plants can satisfy the demand either by themselves or by overtime.

Case 1: Plant 1 Shut Down

Min Z = 3.18 P2,1 + 3.30 P2,2 + 3.28 P2,3 + 3.34 P2,4 + 3.35 P2,5 + 3.88 Q2,1 + 4.00 Q2,2 3.98 Q2,3
4.04 Q2,4 4.05 Q2,5 + 6000 + 12000 + 15000

Let P2,1 be the amount of goods produced at normal time from Factory 2 and sent to Wing 1

Let Q2,1 be the amount of goods produced by Factory 2 through Over-Time and sent to Wing
1

Let P2,2 be the amount of goods produced at normal time from Factory 2 and sent to Wing 2

Let Q2,2 be the amount of goods produced by Factory 2 through Over-Time and sent to Wing
2

Let P2,3 be the amount of goods produced at normal time from Factory 2 and sent to Wing 3

Let Q2,3 be the amount of goods produced by Factory 2 through Over-Time and sent to Wing
3

Let P2,4 be the amount of goods produced at normal time from Factory 2 and sent to Wing 4

Let Q2,4 be the amount of goods produced by Factory 2 through Over-Time and sent to Wing
4

Let P2,5 be the amount of goods produced at normal time from Factory 2 and sent to Wing 5

Let Q2,5 be the amount of goods produced by Factory 2 through Over-Time and sent to Wing
5

Similarly we can assume decision variables for the other factory sending to all 5 Wings

The Constraints are:-

Q2,1 + Q2,2 + Q2,3 + Q2,4 + Q2,5 ≤ 5,000 (for Overtime)

P2,1 + P2,2 + P2,3 + P2,4 + P2,5 ≤ 20,000 (for Regular Time)

P2,1 + P3,1 + Q2,1 + Q3,1 ≥ 9,000 (for Demand)

Similarly we can derive supply constraints for other 5 wings

The same Pattern can be followed for all cases assuming one of the factories to be closed
and other two operating.