Roll No. ..............

Thapar Institute of Engineering & Technology, Patiala

Department of Mathematics
End Semester Examination (May 20, 2024)
Course Name: Optimization Techniques M. Marks: 40
Course Code: UMA035 Time: 3 Hrs
Faculty: Dr. Meenakshi Rana, Dr. Amit Kumar, Dr. Vikas Sharma, Dr. Sanjeev Kumar, Dr Navdeep Kailey, Dr. Pankaj
Narula, Dr. Jolly Puri, Dr. Mamta Gulati, Dr. Farhan Musanna, Dr. Rajesh Dhayal, Dr. Tina Verma, Dr. Rajanish Rai

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

1. (a) XYZ enterprises is having four plants that are manufacturing cars and are located at different locations.
The cars are being supplied from plant to three distribution centers and vary in transportation cost. The
transportation cost from each plant to each distribution center is given below: [1+4]

D1 D2 D3 Availability
P1 1 2 5 30
P lant P2 9 7 8 40
P3 4 5 2 20
P4 3 5 4 60
Requirement 40 50 60

(i) Find the initial BFS for the above transportation problem using Least Cost Method (LCM).
(ii) Using above initial BFS, calculate the Optimal transportation cost using UV-Method (Take u1 = 0).
(b) Solve the problem using Dual Simplex Method [3]

M inimize Z = 4x1 + 8x2 + 3x3 subject to x1 + x2 ≥ 2, 2x1 + x3 ≥ 5, x1 , x2 , x3 ≥ 0.

2. (a) Consider the following simplex tableau of a linear programming problem (maximization) at some iteration:

Basic Variables x1 x2 x3 x4 XB (Solution)

zj − cj → 0 D 0 E z∗
x3 0 C 1 2 A
x1 1 −1 0 3 B

State all possible values/range of A, B, C, D, and E in each of the following so that the given statements
are true:
(a) The current solution is optimal but infeasible.
(b) The current solution is feasible but not optimal and the objective function value can be increased by
replacing x3 with x2 . [4]
(b) Perform two iterations of Steepest descent search method to minimize [4]
1 2
f (x1 , x2 ) = x + x22
2 1
with starting point X0 = (x1 , x2 ) = (2, 2).
3. (a) Determine how jobs should be assigned to machine when maximum time taken by a machine to do a job
is given in following table. [6]

Job
J1 J2 J3 J4 J5
M1 40 40 35 25 50
Machine M2 42 30 16 25 27
M3 50 48 40 60 50
M4 20 19 20 18 25
M5 58 60 59 55 53
 (b) Find the values/range of α and β such that the given solution is optimal. (While checking the optimality,
take u1 = 0 for source 1) [2]
D-1 D-2 D-3 Supply
Source 1 4 α 9 50

20 30

Source 2 β 7 8 60
10 30 20

Demand 30 30 50

4. (a) Consider the following project with crash and normal durations as well as cost involved.
Activity Normal time (Weeks) Normal Cost (In $.) Crash Time (Weeks) Crash Cost (In $.)
1-2 4 130 1 220
1-3 3 130 1 150
1-4 3 200 1 210
2-5 5 100 2 190
3-6 2 50 1 80
4-6 10 150 9 180
5-6 7 200 5 250
(i) Determine the critical path, normal duration and normal cost of the project.
(ii) Determine the optimal cost of project duration if it is to be reduced by 2 Weeks. [3+2]
(b) Solve the Multi-objective Programming Problem: [3]

(Maximize f1 , Minimize f2 , Maximize f3 )

wheref1 = x1 + 6x2 , f2 = 3x1 − x2 , f3 = 10x1 + 2x2

subject to
2x1 + 3x2 ≤ 10, 3x1 + 2x2 ≤ 12, x1 , x2 ≥ 0.

5. (a) Consider the following non-linear programming problem: [4.5]

f (x1 , x2 ) = 2x21 + 3x22 subject to x1 + x2 ≤ 5.

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

(b) Compute the Hessian matrix of the function at a point (0,2): [3.5]

f (x1 , x2 ) = ex1 x2 + x2 .

6. (a) Use Lagrange Multiplier Method to find the maximum of [4]

f (x1 , x2 ) = −x21 − 2x1 x2 − x22 + 2x3 subject to 3x1 + x2 = 4, 2x1 − x3 = 6.

(b) Find the extreme values of f (x1 , x2 ) = −2x21 + 4x1 x2 − 4x22 + 4x1 + 4x2 + 10, and hence find maxima or
minima of given function. [4]

————END———–

The Answer-sheets will be shown on June 06, 2024. The time & venue details will be added on LMS.