The initial basic feasible solution is obtained by putting x

Last updated: 10/9/2023

The initial basic feasible solution is obtained by putting x x x3 X4 0 in the reformulated form of LPP and we get x5 900 x6 1200 Starting Simplex Table CB M M CB First Iteration M 60 CB 80 60 XB X5 900 Ys 20 X6 1200 Y 40 60M z CBi Yij j 1 Z Gj XB X 300 X 30 Second Iteration C 5 72 C YB 72 z CBi Yij 1 Z G Y Y6 Y C YB z CBiYij 1 Z G 60 Y 60M 60 0 0 1 60 60 Y XB X 20 Y 0 X 15 Y 1 60 Y 60 0 11 30 30 60M 80 60M 80 15 3 4 Y 80 Y 15M 45 0 15M 35 80 Y 1 0 80 12 0 Y3 Y 1 0 M 0 M M 1 0 M M 0 0 Y3 1 15 1 20 7 3 0 1 M Y3 Y4 7 3 HHH 0 lo M 2 3 2 M 2 3 2 1 3 Hence an optimal basic feasible solution is obtained Solution is x 15 x 20 and Max 2 2500 M M Ys 1 0 1 M M 0 Y4 1 30 1 20 1 3 0 1 2 1 1 40 0 0 M Y5 M Y 0 0 Ratio Ratio XBi Yir 20 40 45 30 XBi Yir