A manufacturer of steel ingots has plants at two cities, C1 and C2.The ingots are supplied to four markets, M1, M2, M3, and M4. The manufacturer wants to know the pattern of shipment from each production plant to each market that would minimize the total transportation cost. You are given the following data on capacity and demand as also the unit transportation cost.

Plant capacities (units each):

Origin 1(plant in C1) = 3000

Origin 2(plant in C2) = 1000

Destination demands (units each):

Destination 1(market M1) = 800

Destination 2(market M2) = 1200

Destination 3(market M3) = 300

Destination 4(market M4)= 1700

Unit transportation costs (in rupees)

From origin 1 to destination 1 = 5

From origin 1 to destination 2 = 8

From origin 1 to destination 3 = 2

From origin 1 to destination 4 = 6

From origin 2 to destination 1 =7

From origin 2 to destination 2 = 5

From origin 2 to destination 3 = 10

From origin 2 to destination 4 = 4

The management wants to determine the total transportation cost associated with the optimal schedule. Represent the information in a transportation tableau. Formulate this as a Linear Programming problem. (Do not solve the Transportation Problem for optimum solution)