Scribd
Upload
144 views1 page

School of Mathematics, Thapar Institute of Engineering and Technology Optimization Techniques (UMA-031) Tutorial Sheet # 2

This document contains tutorial problems related to optimization techniques. It includes problems on linearizing objective functions, writing linear programs in standard form, determining convexity of sets graphically, finding extreme points of a set, solving linear programs graphically, and identifying unboundedness in a linear program. Multiple linear programs involving two variables are presented along with their constraints for graphical solution.

Uploaded by

Ankit Kushwaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
144 views1 page

School of Mathematics, Thapar Institute of Engineering and Technology Optimization Techniques (UMA-031) Tutorial Sheet # 2

This document contains tutorial problems related to optimization techniques. It includes problems on linearizing objective functions, writing linear programs in standard form, determining convexity of sets graphically, finding extreme points of a set, solving linear programs graphically, and identifying unboundedness in a linear program. Multiple linear programs involving two variables are presented along with their constraints for graphical solution.

Uploaded by

Ankit Kushwaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

School of Mathematics,

Thapar Institute of Engineering and Technology


Optimization Techniques (UMA-031)
Tutorial Sheet # 2
1. Linearize the following objective function: Max z  min  2 x1  5 x 2 , 7 x1  3x 2 
2. Write the standard form of the LPP

(i) Max Z  2 x1  x2  x3
s. t. x1  x2  2 x3  2 , 2 x1  x2  x 3  4 , 3x1  2 x2  7 x3  3
x1 , x3  0 , x2  0

(ii) Max Z  x1  2 x2  x3
s. t. x1  x2  x3  5 ,  x1  2 x2  3x3  4 , 2 x1  3x2  4 x3  3 , x1  x2  x3  2 ,
x1  0 , x2  p, x3 is unrestricted in sign.

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


(a) {( x1 , x2 ) : x1 x2  1} (b) {( x1 , x2 ) : x1  x2  1}
2 2
(c) {( x1 , x2 ) : x1  x2  3}
2 2

(d) {( x1 , x2 ) : 4 x1  x2 } (e) {( x1 , x2 ) : 0  x1  x2  4} (f) {( x1 , x2 ) : x2  3   x1 , x1 , x2  0}


2 2 2 2

(g)  ( x1 , x2 ) : 2 x1  5x2  20, x1  2 x2  6 (h)  ( x1, x2 ): x1 x2  4, x1, x2  0 


(i) {( x1 , x2 ) : x1  x2  1} (j) {( x1 , x2 ) :3x1  2 x2  6}
2 2 2 2

4. Find all the extreme points of the set S  ( x1 , x2 ) x1  2 x2   2 ,  x1  x2  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  5x1  3x2 , s / t 3x1  5x2  15, 5x1  2 x2  10, x1 , x2  0.
(ii) Min z  2 x1  3x2 , s / t x1  x2  4, 6x1  2 x2  8, x1  5x2  4, x1  3, x2  3, x1 , x2  0.
(iii) Max z  2 x1  2 x2 , s / t x1  x2  1,  0.5x1  x2  2, x1, x2  0.
(iv) Max z  3x1  2 x2 , s / t x1  x2  0, x1  3, x1 , x2  0.
(v) Max z   x1  2 x2 , s / t x1  x2  1,  0.5x1  x2  2, x1 , x2  0.
(vi) Max z  3x1  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  3x2  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