Roll Number:

Thapar Institute of Engineering and Technology, Patiala

B.E/B.Tech UMA035: Optimization Techniques

Q I . (a) The AGMC has two plants, each of which produces and supplies two products: milk and butter. Each plant can
work up to 16 hrs a day. In plant A, it takes 3 hrs to prepare and pack 1000 liters of milk and 1 hr to prepare
and pack 100 kg of butter. In plant B, these figures are 2 hrs and 1.5 hrs. In plant A (B) it cost
Rs. 15000(18000) to prepare and pack 1000 liter of milk and Rs. 28000(26000) for 100 kg of butter daily.
The AGMC is obliged to produce daily at least 10000 liters of milk and 800 kg of butter. Formulate the
problem as a Linear Programming Problem(LPP). [4 marks]
(b) State and prove Fundamental theorem of Linear Programming Problem (LPP) for
maximization case only. [2.5 marks]
Q2. (a) Find the optimal solution of given LPP by graphical method. Also find the optimal solution by
simplex method and show the correspondence of basic feasible solution with corner points of
feasible region.
Max z = 6x1 — 2x2, Subject to 2x1 — x2 5 2, xi 5 4, xi, x2 0. [3.5 marks]
(b) Find the optimal solution of LPP (if exists) by using Big M method.
Max z = 3x1 + 2x2 + x3
Subject to 2x1 + x2 + x3 = 12, 3x1 + 4x3 = 11, xi is unrestricted and x2, x3 0.
[3 marks]
(c) Consider the following LPP as primal problem: Max z = 5x1 + 12x2 + 4x3
subject to xi + 2x2 + x3 .5 5, 2x1 — x2 + 3x3 = 2, 2x1 + x2 3, xi, x2, x3 > 0.
Write the dual of above LPP. Using complementary slackness conditions, find the optimal
solution of dual and it is given that s3 (surplus variable in third constraint), xi and x2 are the
basic variables in the primal optimal table with nonzero value. [3.5 marks]
Q3. (a) Prove that intersection of two convex set is a convex set. [2 marks]
(b) Consider the following LPP: Max z = —x1 + 2x2 — x3
subject to xi + 2x2 - 2x3 5. 4, x1 — x3 5 3, 2x1 — x2 + 2x3 5. 2, xi, x2, x3 0.
The optimal table of given LPP is as follows (where si, s2 and s3 are slack variables corresponding
to first, second and third constraint respectively.):
Basic x1 x2 x3 si S2 S3 Solution
Variable
zi — c1 9/2 0 0 3/2 0 l 8
x2 3 1 0 1 0 I 6
s2 7/2 0 0 1/2 1 I 7
x3 5/2 0 1 1/2 0 1 4
(i) Using sensitivity analysis, find the optimal solution and optimal value if a new constraint
x1 + x2 = 4 is added in the given LPP. [2 marks]
(ii) Within what range the coefficient of xi in the objective function varies without affecting the
optimality. [1.5 marks]
(c) The optimal Simplex table of LPP is given below (xi, x2 are decision variables and si, s2 and s3 are
slack variables corresponding to first, second and third constraint respectively). Find the Linear
Programming Problem. [3 marks]

Basic xi x2 s1 s2 s3 Solution
Variable
z•1 — c•1 0 0 1 0 0 9
xi. 1 0 1 0 0 2
s2 0 0 1 1 —1/2 1/2
x2 0 I —1 0 1/2 3/2