Question: Consider the following transportation Linear Programming problem where Xij indicates quantities shipped from ith source to jth destination MINIMIZE 100X11+50X12+90X13+100X21+80X224200x23+140X31+120X32+80X33 SUBJECT TO : X11+X12+x13=350 X12+x22+X32>=150

Consider the following transportation Linear
Consider the following transportation Linear Programming problem where Xij indicates quantities shipped from ith source to jth destination MINIMIZE 100X11+50X12+90X13+100X21+80X224200x23+140X31+120X32+80X33 SUBJECT TO : X11+X12+x13=350 X12+x22+X32>=150 X13+X23+X33>=400 All Xij>=0 Answer the following questions: (a) Setup a proper table for the above problem for Simplex Transportation method and find the Initial Basic Feasible Solution using MIINIMUM COST METHOD. Compute the total cost. (b) is the solution found in (a) above is OPTIMAL? If not, workout the OPTIMAL shipping schedule. Clearly show all the iterations and write down the optimal shipping schedule and the associated total cost

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!