Description
OR-Lab 7 (24.02.2021)
Problem 1: –
Make a menu driven program using Revised-Simplex with the following options (a) initial table (b) List of basic & non-basic variables for ith iteration (c) optimal solution (if exists otherwise generate report for infeasibility, unboundedness, alternative optimum etc.)
Problem 2:-
Test the following numerical problems using your code.
- MAX Z = 5×1 + 10×2 + 8×3
subject to
3×1 + 5×2 + 2×3 ≤ 60 |
4×1 + 4×2 + 4×3 ≤ 72 |
2×1 + 4×2 + 5×3 ≤ 100
and x1,x2,x3 ≥ 0
- MAX Z = 4×1 + 3×2
subject to
2×1 + x2 ≤ 1000
x1 + x2 ≤ 800
x1 ≤ 400 |
x2 ≤ 700 |
and x1,x2 ≥ 0
- MAX Z = 3×1 + 3×2 + 2×3 + x4
subject to
2×1 + 2×2 + 5×3 + x4 ≤ 12
3×1 + 3×2 + 4×3 ≤ 11
and x1,x2,x3,x4 ≥0
- D) MAX Z = 3×1 + 5×2 + 4×3
subject to
2×1 + 3×2 ≤ 8
2×2 + 5×3 ≤ 10
3×1 + 2×2 + 4×3 ≤ 15
and x1,x2,x3 ≥ 0
(E)Â MIN Z = 3×1 + 3×2 + 2×3 – x4
subject to
2×1 + 2×2 + 5×3 + x4 ≥ 43
3×1 – 3×2 + 4×3 ≥ 11
4×1 – 2×2 + 3×3 – x4 ≥ 25
and x1,x2,x3,x4 ≥ 0