Roll No.

Thapar Institute of Engineering & Technology, Patiala

Department of Mathematics
Auxiliary Examination (May 23, 2024)
Course Name: Optimization Techniques M. Marks. 100
Course Code: UMA035/UMA031 Tinic: i irs
Faculty: Dr. Meenakshi Rana

NOTE : Attempt any 10 questions with legible handwriting and write answers of subparts of each
question in sequence with full justifications to support the answer.

1. TIET has to organize its annual cultural festival continuously for the next five days. There is an arrangement
of dinner for every invited team. The requirement of napkins during these five days is

Days 1 2 3 4 5
Napkins required 80 50 100 80 150

Accordingly, a caterer has been requested to supply the napkins as per above schedule. After the festival is
over caterer has no use of napkins. A new napkin costs Rs. 2. The washing charge for a used napkin is Rs.
0.5 by ordinary service and Rs. 1 if express service is used. A napkin given for washing by ordinary service is
returned third day, while under express service it is returned on next day. How the caterer should meet, the
requirement of the festival organizers so that the total cost of napkins is minimized. Formulate the problem as
a LPP model. 1101

2. (a) Find all possible Basic Feasible Solutions of the following problem,

Max z = xi — 2x2 + 3x3 subject to 2x1 + 2x2 + 2x3 < 6, 2x1 + (5/2)x2 + x3 < 6, x i , > 0.

Hence find the optimal basic feasible solution.

(b) State and prove Weak Duality Theorem. (4 )
3. Solve the given LPP using graphical method;

Max z = 2x1 + x2 subject to xi + 2x2 < 10, — xi + x2 < 6, x i — x2 < 2, x i ,x2 > O.

Write the dual of the above LPP and obtain its optimal solution using the complementary slackness conditions.
4. Solve the LPP using Big M method 1101

Max z = 3x1 — x2 subject to 2x1 + x2 > 2, xi + 3x2 < 2, x2 < 4, xi , x2, x3 > 0.

5. The following table gives the optimal solution to a LPP in which si, s2, s2 are slack variables with LPP E;s:

Max z = 3x1+2x2 + 5x3 subject to x1 + 2272 + x3 < 40, 3x1 + 2x3 < 60, xi 4x2 < 30, xi,x2, 373 > 0.

110;

B.V. x1 x2 x3 s1 s2 S3 SM.
Z3 - CJ 4 0 0 1 2 0 160
x2 -1/4 1 0 1/2 -1/4 0 5
x3 3/2 0 1 0 1/2 0 30
.53 2 0 0 -2 1 1 10

(i) Find the value of ci (coefficient of x1 in objective function) so that the present LPP has an alternate optima!
solution.
(ii) Find the optimal solution of LPP if the value of 61 (R.H.S. of first constraint) is increased by 3.
PTO
 n. '-,olve ill/ ',Mowing 1n1+ ,g1 ,1 1»os.,rraniiiiing problem using Tit anch and I3ound method.

.1/(.r :11 .r.> subject to 3d < 12: :1. 2 < 2. intt 'I.',

the dlowing transportation problem (TP). find the solution of given TP by finding initial I3FS using
;•,,t :11(1.11,,d ;WI

Origin D2 D3 Destination
01 10 13 6 10
02 16 7 13 12
03 8 22 2 8
Demand 6 11 13

Four e)Igi In 'I Ting studunts A i . A 2, .43 and /11 of an institute are to design four projects P1 , P2. P3 and P4 . Given
the following time estimaics {no. of Hours) needed for each student to design a project, determine the optimal
assignment tittle for four proj,,cts using Hungarian method. I n!

I- Pi P2 P3 P4
Al 35 27 28 37
A2 28 37 29 40
A3 35 24 32 33
A4 24 32 25 28

Consider I he following project with crash and normal durations as well as cost involved. 1 101
Activity Normal time (days) Normal Cost (Rs.) Crash Time (days) Crash Cost (Rs.)
I -2 3 300 2 400
2- 3 3 30 3 30
2-4 7 420 5 580
2-5 9 720 7 810
:1-5 5 250 4 300
-I-5 0 0 0 0
.5-6 6 320 4 410
6-7 4 400 3 970
6-8 13 780 10 900
7-8 10 1000 9 12011

(1) Determine the critical path, normal duration and normal cost of the project.
Determine the optimal cost for reduction of project duration time by 30 days.

10. (a) Consider the following non-linear programming problem:

1 51
f(xi,x2)=5x? + 34 subject to xi +12 < 8.

Use the liarush-Kuhn-Tucker (KKT) conditions to find the optimal solution.

Mild the extreme values of f (x , x 2 ) =. 4x? + 81112 — 24 4 4xi 43:2 10, and hence find maxima ift
nliuilna of given function. 151
I. (a) Zlse Lagrange Multiplier Method to find the optimal value of

f(xi,x2) = x?+3x i x2 + 4- xi + 3x2 subject to xi — 4 =

(I)) Perform t,wo iterations of Steepest descent search method to minimize 31

.1(x1,x2) = 3x2
with starting point Xo x2 (1,2).

END OF PAPER