Given below is iteration in a Simplex Table for a Maximization Objective linear programming product mix problem for Variables Values 6 4 10 0 Minimum Ratio x1 s1 3 0 s1 o olu ol 0 400 0 s2 -1/3 1/3 X2 4/3 2/3 5/3 0 1 X1 6 400 1 2 o 0 400 s3 o 0 0 -2/3 1 4 12 0 6 Z 2400 2 0 0 -2 o 0 -2 0 NER C.Z Answer the following questions: (i) Is the above solution feasible? (ii) Perform one more Iteration with X2 entering the solution to get a solution with the same value for the Objective Function. (iii) Indicate the Shadow Prices. (iv) # Customer is prepared to pay higher price for product X3, then by how much should the Price be increased so that the Company's Profit remains unchanged? mosting & Q.T.) 1 709