its all clear

I. PROBLEM SOLVING. Provide all the iterations and steps neatly and clearly in your answer sheet 1. Solve the following Linear Programming Problem(LPP) using Simplex Method (15 Pts) max 2 = 5x1 + 4x2 Subject to 6x1 + 4x2 = 24 x1 + 2x2 S6 -*1 + x2 51 X2 S2 20 *1,*2 (Rubric: 15 Pts + 3 Pts for standard form of LPP, 3 points for initial table, 4pts @ 2 pts for each iteration, 2 points for correct values of xl and x2 + 3 Pts for presentation of the problem) 2. For the Transportation Problem given by the following tableau, find an initial basic feasible solution by Vogel's method and then find an optimal solution. (15 Pts) L1 L2 L3 SUPPLY si 9 15 12 10 S2 6 8 13 23 S3 9 3 11 27 DEMAND 21 14 25 (Rubric: 15 Pts 3 Pts for correct calculation of penalty + 3 Pts for correct initial basic feasible solution using VAM method + 3 Pts for correct application of solution improvements + 3 Correct final solution + 3 points for presentation skills of the problem) ****