Roll Number:

Thapar Institute of Engineering & Technology, &Willa

School of Mathematics
MST
BE 2" (ME) ./ 3'd year (MTX) Course Code: UMA 034
Course Name: Optimization Methods
Sep 27, 2022
Time: 2 Hours. M. Marks: 25 Name of Faculty: Amit Kumar, Meenakshi Rana

Ql. Find all basic feasible solutions of the following system of equations
2x1 — x2 — x3 + x4 = 3, x, — x2 + x3 = 4, x, 0, x2 ?_ 0, x3 0, x4 > 0 (3 marks)

Q2. Use the following methods to solve the linear programming problem

Minimize (4x1 + 5x2 ) subject to x1 + x2 3, 2x1 + 4x2 = 8, x1 > 0, x 2 0.

(i) Graphical method. (3 marks)

(ii) Two-phase method (4 marks)

Q 3. State and Prove weak duality theorem. (3 marks)

Q 4. Write the dual of the linear programming problem

Max (x1 + 3x2 — 6x3 ) subject to xi — 2x2 + 5x3 5 1, + 2x2 —4,x1 — 5x2 + 3x3 = 10,

x1 5 0, x2 is unrestricted, x3 > 0. (3 marks)

Q5 . On solving the linear programming problem Max (—x1 + 2x2 — x3 ) subject to x1 + 2x2 -2x3 5 4, x1 — x3 5 3,

2x1 — x2 +2x3 5 2, xi. 0,x2 ?_ 0,x3 0, S2 ?_ 0, S3 ?_ 0, the following optimal table is obtained.

B.V x1 x2 x3 Si S2 S3 Solution
Z.1 - C 1• 9 0 0 3 0 1 8
2 2
x2 3 1 0 I 0 1 6
52 7 0 0 1 1 1 7
2 2
x3 5 0 1 1 0 1 4
2 2
(i) Find the range of cost coefficient c2 of variable x2 such that current soli tion remains optimal. (2 marks)
(ii) lf RHS of original problem is changed to (5,4,1)T then find new optimal solution. (I marks)
(iii) Find the optimal solution if the constraint x1 + x2 5 4 is added in the current LPP. (2 marks)
Q 6. Using Branch and bound method solve the following the integer linear programming problem

Minimize (—x1 — 2x2) subject to 2x2 5. 7 , x1 + x 2 < 7, 2x1 5 11,x1 ?_ 0,x2 0,x1 and x2 are integers. (4 marks)