Yeshwantrao Chavan College of Engineering, Nagpur

Department of Mathematics & Humanities

Even term/Summer Term (Session 2019-20)
Mid Semester Examination-III

Course Name: Advanced Mathematical Techniques Course Code: GE-2204

Semester: IV
Time: 1.5 Hrs. Max. Marks: 30

Note:- Question 1(a) and Question 2(a) are compulsory

Q.1 A) 0.8 0.9 0.6 0.7 0.3

Given A = { 3 , , } and B = { 3 , } be two fuzzy sets.
4 5 5
Verify De-Morgan’s law A ∪ B = A ∩ B . ( symbols have their usual meaning) [5] CO-3

B b1) Let the Crisp Universal set X = {1, 2, 3, 4}. Let Fuzzy sets are
0.3 0.5 0.8 0.7 0.9 0.4
A = { 1 , 2 , 4 } and B= { 1 , 3 , 4 }
Compute
(i) 𝑅 = 𝐴 × 𝐵
(ii) Matrix of Fuzzy relation R denoted by 𝑀𝑅
(iii) Draw the diagraph of 𝑀𝑅
[5]
CO-3
OR

0.3 0.5 0.7

b2) Let X = { p , q , r } and A={p , , }
𝑞 r
Check (i) A ∩ A is empty or not
(ii) A ∪ A is A or not

C c1) 0.3 0.3 0.7 0.7 0.2 0.8 0.2 0.8

Let X = { a , b , c , d }, A = { , , , } and B= { , , , }
a b c d a b c d
Find truth value of
(𝑖 ) 𝐴 ∨ B (ii) 𝐴 ∧ B (iii)𝐴 → 𝐵 (iv) (𝐴 → 𝐵) ∧ (𝐵 → 𝐴)
[5]
CO-3
OR
c2)
Let X = { 5 , 10 , 20 , 30 , 40 , 50 , 60 , 70 }
A = { 0.5 , 1 , 0 , 0 , 0 , 0 , 0 , 0} and B = { 1 , 1, 0.8 , 0.5 , 0.2 , 0.1 , 0 , 0 }
C = { 0 , 0, 0.1 , 0.2 , 0.4 , 0.6 , 0.8 , 1 }
Find (i) A∩ B , (ii) A ∪ (B ∩ C ) (iii) is A ∪ (B ∪ C) = (A ∪ B) ∪ C

Q.2 A) A company produces two types of hats. Each hat of the first type requires twice
as much labour time as the second type. The company can produce a total of
500 hats per day. The market limits the daily sales of the first and second type
to 150 and 250 hats. Assuming that the profit per hat is Rs. 8 for type A and Rs. [5] CO-4
5 for type B, formulate the problem as Linear Programming model in order to
determine the number of hats of each type to be produced so as to maximize the
profit.

B b1) Using graphical method solve the following Linear programming problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 + 3𝑥2 Subject to Constraints
3𝑥1 + 2𝑥2 ≤ 12 , 𝑥1 + 3𝑥2 ≥ 6 , 4𝑥1 + 2𝑥2 ≥ 8 𝑎𝑛𝑑 𝑥1 ≥ 0, 𝑥2 ≥ 0. [5]
CO-4
OR
b2) Use Simplex method to solve the following Linear programming problem
𝑀𝑖𝑛imize 𝑍 = 𝑥1 − 3𝑥2 + 2𝑥3 Subject to Constraints
3𝑥1 − 𝑥2 + 2𝑥3 ≤ 7 , − 2 𝑥1 + 4𝑥2 ≤ 12, −4𝑥1 + 3𝑥2 + 8𝑥3 ≤ 10 𝑎𝑛𝑑
𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0
C c1) Use Simplexmethod to solve the following Linear programming problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 4𝑥1 + 10𝑥2 Subject to Constraints
[5]
2𝑥1 + 𝑥2 ≤ 50 , 2 𝑥1 + 5𝑥2 ≤ 100, 2 𝑥1 + 3𝑥2 ≤ 90, CO-4
𝑎𝑛𝑑 𝑥1 ≥ 0, 𝑥2 ≥ 0.
OR
c2) Using Big-M method solve the following Linear programming problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 2𝑥2 Subject to Constraints
2𝑥1 + 𝑥2 ≤ 2 , 3𝑥1 + 4𝑥2 ≥ 12 𝑎𝑛𝑑 𝑥1 ≥ 0, 𝑥2 ≥ 0.