Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 1

School of Mathematics, Thapar University

Optimization Techniques (UMA-031)


Tutorial Sheet # 2
1. Linearize the following objective function: Max z min 2 x1 5 x 2 , 7 x1 3 x 2
2. Write the standard form of the LPP

(i) Max Z 2 x1 x 2 x 3
s. t. x1 x 2 2 x 3 2 , 2 x1 x 2 x 3 4 , 3 x1 2 x 2 7 x3 3
x1 , x 3 0 , x 2 0

(ii) Max Z x1 2 x 2 x 3
s. t. x1 x 2 x3 5 , x1 2 x 2 3x3 4 , 2 x1 3 x 2 4 x 3 3 , x1 x 2 x3 2
, x1 0 , x 2 p, x3 is unrestricted in sign.

3. Examine graphically, whether the following sets are convex or not:


2 2 2 2
(a) {( x1 , x 2 ) : x1 x 2 1} (b) {( x1 , x2 ) : x1 x2 1} (c) {( x1 , x2 ) : x1 x2 3}
2 2 2
(d) {( x1 , x2 ) : 4 x1 x2 } (e) {( x1 , x2 ) : 0 x1 x2 4} (f)
2
{( x1 , x2 ) : x2 3 x1 , x1 , x2 0}
(g) ( x1 , x2 ) : 2 x1 5 x2 20, x1 2 x2 6 (h) ( x1 , x2 ): x1 x2 4, x1 , x2 0
2 2 2 2
(i) {( x1 , x2 ) : x1 x2 1} (j) {( x1 , x 2 ) : 3 x1 2 x 2 6}

4. Find all the extreme points of the set S (x 1 , x 2 ) x1 2 x 2 2 , x1 x 2 4, x1 4 and


represent the
point (2, 3) as the convex combination of the extreme points of S .

5. Solve the following linear programming problems graphically and state what your solution indicate.
(i) Max z 5 x1 3 x2 , s / t 3 x1 5 x2 15, 5 x1 2 x2 10, x1 , x2 0.
(ii) Min z 2 x1 3 x2 , s / t x1 x2 4, 6x1 2 x2 8, x1 5 x2 4, x1 3, x2 3, x1 , x2 0.
(iii) Max z 2 x1 2 x2 , s / t x1 x2 1, 0.5 x1 x2 2, x1 , x2 0.
(iv) Max z 3 x1 2 x2 , s / t x1 x2 0, x1 3, x1 , x2 0.
(v) Max z x1 2 x2 , s / t x1 x2 1, 0.5 x1 x2 2, x1 , x2 0.
(vi) Max z 3 x1 2 x2 , s / t x1 x2 1, 2x1 2 x2 4, x1 , x2 0.
(vii) Max z x1 x2 , s / t x1 x2 0, 3x1 x2 3, x1 , x2 0.

6. Consider the following LPP


Max z 4 x1 6 x2 , s / t 2x1 3 x2 6, x1 x2 1, x1 , x2 0.
Show graphically that the variable can be increased indefinitely while the optimal value of the objective function
remains constant.

You might also like