Question – 1

Answer 1:
 DV: Plate and Mugs (X1,X2)
 OF: Maximize Profit
 LOC: Labor Hours, Pounds of Clay
 Question – 2

Answer 2:
 Decision Variables: Wheat (X1), Oats (X2), Rice (X3)
 Objective Function: Minimize Total cost:
 LOC:
-Minimum Requirment for Vitamin A
-Minimum Requirement for Vitamin D
 Question – 3

Answer:
DV: Mercury (X1), Zinc (X2) and Potassium (X3)
Objective Function: Minimize Total cost.
LOC:
1- (X2 > 200)
2- (X1 > 300)
3- (X3 > 100)
4- (X1+ X2+ X3 >1000)
 Question – 4

Answer:
DV:
1- Amount invested in NC (X1)
2- Amount Invested in Defense Savings Cert (X2)
 3- Amount invested in NIT (X3)
4- Amount invested in Khas Deposit (X4)
Objective Function: Maximize Return
LOC:
1- (X4 <=14000)
2- (X2<X1+X3+X4)
3- (X2+X3>21000)
4- (X1/X3< 1/3)
5- (X1+X2+X3+X4< 70000)

Question – 5
Answer:
DV: No of Tv Commercials (X1), No of Radio Commercials (X2), No of Newspaper Ads (X3)
OF: Maximize exposure
LOC:

1- (15, 000 X1 + 6, 000 X2 + 4, 000 X3 < Rs. 100, 000)

2- (X1< 4)
3- (X2<10)
4- (X3< 7)
5- (X1+X2+X3 < 15)
 Question – 6

To find the optimal cost throughout the network and determine which warehouse will service which
market, we can use the transportation algorithm known as the North-West Corner Method. This method
starts by allocating shipments from the top-left (north-west) corner of the table and moves to the right
and down, satisfying the supply and demand constraints. Here's how we can apply this method to the
given problem:
Step 2: Start at the top-left corner (Sukkur-Karachi) and allocate shipments based on the minimum of
supply and demand. Subtract the allocated value from the supply and demand and proceed to the next
cell. Continue this process until either the supply or demand is satisfied.

Step 3: Move to the next cell (Sukkur-Lahore) and allocate shipments based on the minimum of supply
and demand. Subtract the allocated value from the supply and demand and proceed to the next cell.
Continue this process until either the supply or demand is satisfied.

Step 4: Move to the next cell (Sukkur-Islamabad) and allocate shipments based on the minimum of
supply and demand. Subtract the allocated value from the supply and demand and proceed to the next
cell. Continue this process until either the supply or demand is satisfied.
Step 5: Move to the next cell (Sukkur-Peshawar) and allocate shipments based on the minimum of
supply and demand. Subtract the allocated value from the supply and demand and proceed to the next
cell. Continue this process until either the supply or demand is satisfied.

Step 6: Move to the next row (Haripur-Karachi) and repeat the allocation process.

Step 7: Continue the allocation process until all the demand is satisfied.
Step 8: Calculate the total transportation cost by multiplying the allocated quantities with their
respective transportation costs and summing them up.

Total Cost = (12 * 81) + (8 * 92) + (9 * 5) + (11 * 119) = 972 + 736 + 45 + 1309 = 3062

Based on the allocations, the optimal warehouse-to-market assignments are as follows:

 Sukkur supplies 12 units to Karachi, 8 units to Lahore, and 5 units to Islamabad.

 Haripur supplies 11 units to Peshawar.
 Gwadar supplies 11 units to Peshawar.
 The total cost of transportation throughout the network is 3062.