Question: Consider the following transportation Linear Programming problem where Xij indicates the quantities shipped from ith source to jth destination. Max 8X1 + 4x12 + 11x

Consider the following transportation Linear

Consider the following transportation Linear Programming problem where Xij indicates the quantities shipped from ith source to jth destination. Max 8X1 + 4x12 + 11x + 7% + + 8X1 + 3x2 + 9x2 + 5x24 s.t. X1 + X12 + X1 + X4 s 90 X21 + x2 + x) + X24 s 50 X1 + X21 275 X12 + X22 230 X13 + X23 2 55 X14 + X24 2 40 Xij zo Answer the following questions: (a) Setup a proper table for the above problem for simplex transportation method. (b) Find the initial basic feasible solution using North-West corner method. (c) Use the feasible solution found in (b) above and work out the optimal shipping schedule. Show all the work 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!