Alternative Optimal Solutions

◼ Maximize: z = 4x + 10y
◼ Subject to: 2x + y <= 10
2x + 5y <= 20
2x + 3y <= 18
◼ Sign constraints: x, y >= 0
◼ The initial simplex table:
BV x y S1 S2 S3 Soln.
Z –4 – 10 0 0 0 0
S1 2 1 1 0 0 10
S2 2 5 0 1 0 20
S3 2 3 0 0 1 18
Dipankar Bose - XLRI
Alternative Optimal Solutions –
Continued
◼ The final table (after some iterations):
BV x y S1 S2 S3 Soln.
Z 0 0 0 2 0 40
S1 8/5 0 1 – 1/5 0 6
y 2/5 1 0 1/5 0 4
S3 4/5 0 0 – 3/5 1 6

◼ For the optimal table we find:

◼ x = 0, y = 4 and Optimal value = 40
◼ Here, S1-y-S3 are BV and others are Non-BV
◼ But among Non-BV, x also has relative cost = 0
◼ So it can become BV by replacing one of the current BV
Dipankar Bose - XLRI