BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI, HYDERABAD CAMPUS

ME F344, MF F344 Engineering Optimization SEMESTER-II, 2016-17

Tutorial Sheet 3

Class Assignment Problems

T-3.1. Solve by both big M and graphical methods: T-3.3 Solve by both two-phase and graphical
Maximize z = 2x1 + 2x2 methods
Subject to Maximize z = 5x1 + 4x2
6x1 + 4x2 24 Subject to
x1 5 3x1 + 2x2 6
x1, x2 0 2x1 - x2 6
x1, x2 0
T-3.2. Solve by big M method:
Minimize z = 3x1 + 2x2 +7x3 T-3.4. Solve by two-phase method:
Subject to Minimize z = 2x1 + 3x2 + x3
-x1 + x2 = 10 Subject to
2x1 - x2 + x3 10 x1 + 4x2 + 2x3 8
x1, x2, x3 0 3x1 + 2x2 6
x1, x2, x3 0

Practice Problems

T-3.8 Solve by two phase method:

T-3.5. Solve by big M method: Minimize z = -3x1 + x2 - 2x3
Maximize z = 2x1 + x2 - 3x3 Subject to
Subject to x1 + 3x2 + x3 5
x1 + x2 + x3 6 2x1 - x2 + x3 2
2x1 + x2 = 14 4x1 + 3x2 - 2x3 = 5
x1, x2 0 and x3 unrestricted. x1, x2, x3 0

T-3.6. Solve by both two-phase and graphical T-3.9 Solve by both two phase and graphical
methods methods:
Maximize z = 3x1 + 4x2 Maximize z = -x1 + 4x2
Subject to Subject to
x1 - x2 0 -3x1 + x2 6
2.5x1 - x2 -3 x1 + 2x2 4
x1, x2 0 x2 -3; x1 is unrestricted.

T-3.7. Solve by two phase method: T-3.10 Solve by Big M and two phase:
Minimize z = 3x1 + 9x2 + 12x3 Maximize z = 4x1 + 5x2 + 3x3
Subject to Subject to
x 1 + x2 + x3 0 x1 + x2 + 2x3 20
2x1 + 5x2 + 11x3 5 15x1 + 6x2 - 5x3 50
x1 + 2x2 12; x1, x2, x3 0 x1+ 3x2 + 5x3 30; x1, x2, x3 0
 Solutions to Class Assignment Problems

Hence no feasible solution.

Graphical Solution

[2 + 1 = 3M]
[3*2 = 6M]
Hence no feasible solution.

Graphical Solution

[2 + 1 = 3M]
[4*2 = 8M]