on the right side is the problem and the left side is what i got so far. little lost on where to go from here

better visual

DE N Data O P Q R C1 plant 1 $ 6.00 plant 2 $ 14,00 plant 3 $ 20.00 total demand 300 C2 C3 Capacity of plant $ 1.00 S 4.00 300 $ 5.00 S 8.00 300 $ 14,00 $ 15.00 200 2001 Problem: The following that the delivery cost from a plantaciones The table the demandinformation each stor and a ma rturing city of each Coleman Customer Customer Capacity lodplan 2 Model meet the e nd of each customer and will not exceed the total manufacturing coach of each C2 C3 Capacity of plant 300 4 Decision variables C1 plant 1 plant 2 plant 3 total demand Capacity cont ain that customer at least 25 units from each plant More comer do not want from plant 300 200 200 700 1 Objective functions Min(cost) 6 constraints 7 LS Relation RS [Name] N O P Q R Problem 1: The following table has the delivery cost/unit from a plant to a customer. The table also has the total demand information of each customer and a manufacturing capacity of each plant. Customer 1 Customer 2 Customer 3 Capacity of plant $6 300 Plant 1 Plant 2 $14 300 Plant 3 $20 $15 13 300 300 200 200 700 Total Demand Find the Minimum Transportation Cost that will meet the demand of each customer and will not exceed the total manufacturing capacity of each plant. In addition, meeting the demand and capacity constraint make sure that customer 2 gets at least 25 units from each plant. Moreover, customer 3 do not want any supply from plant 1