Scribd
Upload
38 views2 pages

Uma035 4

The document outlines an auxiliary examination for the Optimization Techniques course at Thapar Institute of Engineering and Technology. It includes various mathematical problems related to linear programming, non-linear programming, and project management techniques, requiring students to formulate, solve, and analyze optimization problems. The examination consists of multiple questions that involve methods such as the Simplex method, KKT conditions, and the critical path method.

Uploaded by

thakurdikshant05
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
38 views2 pages

Uma035 4

The document outlines an auxiliary examination for the Optimization Techniques course at Thapar Institute of Engineering and Technology. It includes various mathematical problems related to linear programming, non-linear programming, and project management techniques, requiring students to formulate, solve, and analyze optimization problems. The examination consists of multiple questions that involve methods such as the Simplex method, KKT conditions, and the critical path method.

Uploaded by

thakurdikshant05
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/ 2

Roll Number:

Thapar Institute of Engineering and Technology, Patiala


Department of Mathematics
AUXILIARY EXAMINATION
Course Code: UMA035/UMA031 February 19, 2024
Course Name: Optimization Techniques
Coordinator: Prof. M K Sharma Time: 3 Hours, M. Marks: 100
Note: Attempt all questions.

Q.1(a) Old hens can be bought at Rs. 2 each and young ones at Rs. 5 each. The (8)
old hens lay 3 eggs per week and the young ones lay 5 eggs per week,
each egg being worth 30 paise. A hen (young or old) costs Rs. 1 per
week to feed. I have only Rs. 80 to spend for hens. Formulate a linear
programming problem to maximize the profit, assuming that I cannot
house more than 20 hens.
(b) Use the Simplex method to solve (12)
Max z = 3x1 + 2x2 subject to x1 + x2 5_ 10, 2x1 + 3x2 5 24, x1, x2 0.
Plot the feasible region using x, and x2 as coordinates. Follow the
solution steps of the simplex method graphically by interpreting the
shift from one basic feasible solution to the next in the feasible region.

Q.2(a) On solving the linear programming problem (10)


Maximize Z = 3x1 + 2x2 + 5x3 subject to
x1 + 2x2 + x3 430, 3x1 + 2x3 460,x1 + 4x2 5_ 420, x1 0, x2 0,x3 0.
The following optimal table is obtained.
x1 x2 x3 x4 x5 x6 Solution
zi — cl 4 0 0 1 2 0 1350
x2 _1 1 0 1 1 0 100
4 2 4
x3 3 0 1 0 1 0 230
2 2
x6 2 0 0 —2 1 1 20

If the constraint 4x1 + x2 + 2x3 548 is added then, using the post optimality
analysis, find the optimal solution of the modified problem.
(b) Solve the following integer linear programming problem graphically using
Branch and Bound method (If in case all the variables are non-integer then solve
the problem by considering the branches for the variable x, only).
Maximize Z = 2x1 + x2 subject to 10x2 + 9x2 5 8, 8x1 + 6x2 1, x1 0, x2 > 0,
xi and x2 are integers. (10)

Q.3(a) Solve the following NLPP using KKT conditions (10)


Maximize z = + 2x1 + x2
subject to 2x1 + 3x2 6, 2x1 + x2 < 4, xi, x2 0.
(b) Perform two iterations of Steepest Descent method to minimize the function
f (xi, x2) = 2xi + 2x1x2 + 4 + x1 — x2. The initial approximation is to be
taken as (0,0). (10)
Q4.(a) Five n-ten are available to do five different jobs. From past records, the time (in
hours) that each man takes to do each job is known and given in the below
table. Find the assignment of men to jobs that will minimize the total time
taken.
11 J2 I3 pl- J5
M1 2 9 2 7 1
M2 6 8 7 6 1
M3 4 6 5 3 1
M4 4 2 7 3 1
M5 5 3 9 5 1
(10)
(b) Consider the following transportation problem:
D, D, D, Availability
S, 2 7 4 5
S2 3 3 1 8
5, 5 4 7 7
S4 1 6 2 14
Requirement 7 9 18 34

(i) Use Least Cost method to find the initial basic feasible solution. (4)
(ii) Determine an optimal solution by using MODI method or u-v method. (6)

Q5.(a) Use Lagrange multiplier method to solve the following non-linear (10)
programming problem (NLPP). Does the solution maximize or minimize
the objective function?
Optimize z = 2xi + 10x2 + 4 + 8x2 + 34 + 6x3 — 100
subject to x1 + x2 + x3 = 20 and x1, x2, x3 0.
(b) A small project consists of the following activities where duration is in days
and cost is in rupees are given in the following table.
Activity Duration Normal Normal Crash Crash
duration cost duration cost
(1-2) 6 6 1400 4 1900
(1-3) 8 8 2000 5 2800
(2-3) 4 4 1100 2 1500
(2-4) 3 3 800 2 1400
(3-4) 0 0 0 0 0
(3-5) 6 6 900 3 1600
(4-6) 10 10 2500 6 3500
(5-6) 3 3 500 2 800
(i) Use critical path method to find the normal duration for completing the
project.
(ii) Find the most economical schedule for completing the project in 19 days.
(10)

You might also like