Scribd
Upload
40 views2 pages

Uma035 3

1. This document appears to be a mid-semester examination for an Optimization Techniques course. It contains 7 questions related to linear programming problems (LPP). Students are instructed to attempt any 5 questions. 2. The questions cover various LPP concepts and solution methods including formulation, fundamental theorem of LPP, graphical representation of feasible regions, standard form, Big-M method, complementary slackness theorem, sensitivity analysis, Gomory's cutting plane method, branch and bound method, and Simplex method. 3. Students are provided with partial or full LPP formulations and tables and are asked to analyze, solve, or extend the problems using the appropriate LPP techniques. Calculators are permitted but graph

Uploaded by

Raunaq Singh
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
40 views2 pages

Uma035 3

1. This document appears to be a mid-semester examination for an Optimization Techniques course. It contains 7 questions related to linear programming problems (LPP). Students are instructed to attempt any 5 questions. 2. The questions cover various LPP concepts and solution methods including formulation, fundamental theorem of LPP, graphical representation of feasible regions, standard form, Big-M method, complementary slackness theorem, sensitivity analysis, Gomory's cutting plane method, branch and bound method, and Simplex method. 3. Students are provided with partial or full LPP formulations and tables and are asked to analyze, solve, or extend the problems using the appropriate LPP techniques. Calculators are permitted but graph

Uploaded by

Raunaq Singh
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


School of Mathematics
•
Mid Semester Examination
B.E. (Senn: IV & VI) Course Code: UMA035
Course Name: Optimization Techniques
Date: 06-04-2022 Day/Time: Wednesday, 16.30 - 18.30 hrs
Time: 2 Hours, M. Marks: 35 Name of Faculty: MKS, AK, MKR, SJK, NK, MG, JPR., BHU, SPNP, TV

Note: (1) Attempt any five questions.


(2) Calculator without graphing mode and alphanumeric memory is permitted.

1. (a) A chemical company produces two products X and Y. Each unit of product X requires 3 hours on operation
I and 4 hours on operation II, while each unit of product Y requires 4 hours on operation I and 5 hours on
operation II. Total available time for operation I and II is 20 hours and 26 hours, respectively. The production
of each unit of product Y also results in 2 units of a by-product Z at no extra cost. Product X sells at profit
of Rs 10/unit while Y sells at profit of Rs 20/unit. By-product Z brings a unit profit of Rs 6 if sold, in► case
it cannot be sold, the destruction cost is Rs 4/unit. Forecasts indicate that not more than 5 units of Z can
be sold. Formulate the linear programming model to determine the quantities of X and Y to be produced,
keeping Z in mind, so that profit earned is maximum. [4 marks]
(b) State and prove fundamental theorem of Linear Programming Problem (LPP) for maximization case only.
(3 marks]

2. (a) Show graphically that the set S = {(x1,x2) E R2 : ]x1] + 1x21 < 1} is convex set. [2 marks]
(b) Solve the following LPP using algebraic and graphical methods, and show the correspondence between basic
feasible solution (BFS) and vertices of the feasible region for given LPP.
Max Z = 6x1 + 5x2
Subject to x1 + x2 < 5; 3x1 + 2x2 < 12; xi , x2 > 0. [5 marks]

3. (a) Write the following LPP in standard form.


Max Z = 2x1 + 3x2 - 7x3
Subject to x1 + 2x2 - x3 < -16; 2x1 + x2 + 4x3 > 10; x1 > 0, x2 < 0 and x3 is unrestricted. [2 marks]
(b) Solve the following LPP using Big-M method.
Max Z = 6x1 + 4x2
Subject to 2x1 + 3x2 < 30; 3x1 + 2x2 < 24; x1 + x2 > 3; xi, x2 > 0. [5 marks]

4. (a) Consider the following LPP as primal problem:


Max Z =5xi - 4x2 + 3x3
Subject to 2x1 +x2 -6x3 = 20; 6x1+5x2+10x3 < 76; 8x1 -3x2+6x3 > 50; x1 is unrestricted, x2 > 0, x3 < 0.
Write t he dual of above LPP. Using complementary slackness theorem, find the optimal solution of dual and
it is given that s3(surplus variable in third constraint), s2 (slack variable in second constraint) and x1 are the
basic variables in the primal optimal table. [4 marks]
(b) State and prove Weak-Duality theorem. [3 marks]

5. Consider the following LPP:


Min Z = x 1 - 2x2 + x3
Subject to xi + 2x2 - 2x3 < 4; xi - x3 < 3; 2x1 - x2 + 2x3 < 12; xi, x2, x3 > O.
Introducing si , 32 and 33 as starting slack variables in the first, second and third constraint respectively, the optimal
table of given LPP is as follows:

Continue
B.V. x1 x2 x3 81 82 83 Solution
zj —ci V 0 0 V- 0 —1 —8
x2 3 1 0 1 0 1 6
82 Z2 0 0 2I 1 1 7
x3 2 0 1 I
2 0 1 4
Using sensitivity analysis, find the optimal solution 'Ind optimal value in each case separately (if exists).

(a) If R.H.S. is changed in the given LPP from (4,3,2)T to (1,4, 11)T. [1 mark]
(b) If a new constraint x1 + x2 = 7 is added in the given LPP. [2 marks]
(c) If a new variable with cost (-1) and column (3, —2, —4)T is added in the given LPP. [2 marks]
(d) In what range the cost. coefficient of x2 varies so that. the optimality of the given LPP is unaffected?[2 marks]

6. (a) Use Gomory's cutting plane method, find the optimal solution of given integer progranuning problem (IPP).
Max Z = 3x1 + 2x2
Subject to xi < 2; x2 < 2; 2x1 + 2x2 < 7; xi, x2 > 0 and are integers.
The optimal Simplex table of above non-integer programming problem is given below.
B.V. x1 x2 s1 32 s3 Solution
zi — ci 0 0 1 0 0 9
x1 1 0 1 0 0 2
0 0 1 1 =I 1
82 2 2
x2 0 1 -1 0 12 3
where, si 82 and s3 are starting slack variables in the first, second and third constraint respectively[4 marks]
(b) Without )erforming Simplex iterations, find the missing of given LPP
Max Z = —x1 + 322 — 2x:3
Subject to 3x1 — x2 + 323 < 7; —2x1 + 4x2 < 12; —4x1 + 3x2 + 8x3 < 10; xi, x2, x3 > 0.
B.V. X'1 x2 x3 S1 82 83 Sol
Zi - Cj -1 0 0 3 *
2 4
S1 * 0 3 * 4 * 10
22 * 1 0 * 4
* 3
83 * 0 8 * -3 4
1

where, s1 , s2 and 53 are slack variables in the first, second and third constraint respectively. [3 itia.rks]

7. (a) Solve the following LPP by using Branch and Bound method:
Max Z = 5.2x1 + 6.3x2
Subject to xi + x2 < 5; 4x1 + 7x2 < 28; x2 > 0 and are integers. [3 marks]
(b) Find the optimal solution of following LPP using Simplex method.
Max Z = xi + 2x2 + 3x3
Subject to xi + 2x2 < 20; 3x3 + 4x3 < 30; x1, x2, x3 > 0. [4 marks]

End of Question Paper

You might also like