Question: Consider the following transportation Linear Programming Problem where Xij indicates the quantities shipped from ith source to jth destination. Minimize Z= 3X11+ 12x12 + 8X13+

Consider the following transportation Linear

Consider the following transportation Linear Programming Problem where Xij indicates the quantities shipped from ith source to jth destination. Minimize Z= 3X11+ 12x12 + 8X13+ 10X21+ 5X22+ 6X23+ 6X31+ 7X32+ 10X33 Subject to : X11 + x21 + X31 = 90 X12 + X22 + X32= 30 X13 + X23 + X33=100 X11 + X12 + X13 =0 for i=1,2,3 and j= 1,2,3 Answer the following questions: (a) Set up a proper table for the above problem for Simplex Transportation method. (b) Find the initial basic feasible solution using North-West Corner Method. (c) Using the solution found in (b) above, find the optimal shipping Schedule. Show all the iterations and clearly write down the optimal shipping schedule and the value of the objective function

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!