Operation Research questions

For the given transportation problem in Table 1 with three supply and four demand points, you are given a basic feasible solution (Table 2). The goal in this problem is to minimize the cost of meeting customers' demands. Plant 1 Plant 2 Plant 3 Demand Table 1 Transportation costs Customer 1 Customer 2 Customer 3 Customer 4 Supply 46 51 65 86 75 35 41 69 79 125 99 68 38 68 100 80 65 70 85 Plant 1 Plant 2 Plant 3 Table 2 Customer 1 Customer 2 Customer 3 Customer 4 75 80 45 20 70 10 Starting from the given bfs, apply the pivoting procedure only once and move to a new bfs. Then, calculate the new objective value. a) 15235 b) 15115 c) 15245 d) 15095 After adding slack variables sl and s2, the optimal tableau for the given LP model is as shown in the table below. max z = 3x1 + 7x2 + 5x3 S.t. x + x2 + x3 = 50 2xy + 3x2 + x3 = 100 X1, X2, X3 > 0 Basic Variable ths X2 Z X1 S2 X3 $1 Z 3 1 - 300 0 1 0 0 0 0 1 1 -- INI-NIWA - 300 25 25 X3 = 25 X2 = 25 What is the shadow price for constraint 2? a) 4. b) 5 c) 2 d) 1