Description
Class 6
Make a menu driven program using Two Phase Simplex/ Dual Simplex with the following options (a) initial table (b) List of basic & non-basic variables for ith iteration (c) table of ith iteration (f) optimal solution (if exists otherwise generate report for infeasibility, unboundedness, alternative optimum etc.)
1. Minimize 20 16 , Subject to 2.5, 6, 2
17, 12, , 0.
2. Minimize 4 8 3 , Subject to 2, 2 5, , , , 0.
3. Maximize 15 6 9 2 , Subject to 10 5 25
3 50, 12 4 12 48, 7 35, , , , 0.
4. Maximize 5 2 3 , Subject to 2 2 2,
3 4 3 , 3 3, , , 0.
5. Max z = 2×1 + 3×2 + x3, Subject to x1 + x2 + x3 ≤ 40 ,
2×1 + x2 − x3 ≥ 10 ,,−x2 + x3 ≥ 10; x1, x2, x3 ≥ 0
6. Max Z = 5×1 + 8×2, Subject to 3×1 + 2×2 ≥ 3,×1 + 4×2 ≥ 4, x1 + x2 ≤ 5; x1 ≥ 0, x2 ≥ 0
