1. Below Simplex Table is not a basic feasible solution table. Why?
Convert that to a basic feasible solution table.
| | p | x1 | x2 | x3 | s1 | s2 | s3 | R.H.S. |
| P | 1 | 0 | 0 | -10 | 80 | 30 | 0 | 15000 |
| x2 | 0 | 0 | 3 | 27 | 45 | 18 | 0 | 183 |
| x1 | 0 | 1 | 0 | 12 | 73 | 24 | 0 | 115 |
| s3 | 0 | 0 | 0 | -15 | 27 | -12 | -1 | -40 |
2. Below Simplex Table is an optimal table. Why?
It also has alternate optimal. Find that. (No need to prepare the complete table.)
Since it has an alternate optimal, it has infinite number of optimal solution. Can you provide some expression to find as many optimum solutions as you want in this case? (send this by mail to get upto 10 marks from the class involvement part. Deadline: 9/11/11, 5 PM)
| | p | x1 | x2 | x3 | s1 | s2 | s3 | R.H.S. |
| P | 1 | 25 | 0 | 0 | 10 | 0 | 0 | 7500 |
| x3 | 0 | -15 | 10 | 1 | 8 | 0 | 0 | 305 |
| s2 | 0 | 12 | 25 | 0 | -5 | 1 | 0 | 670 |
| s3 | 0 | 3 | 15 | 0 | 12 | 0 | 1 | 320 |
