TSEC Mumbai

Computer Engineering Semester-IV

Term Work Assignment & Question Bank
Engineering Mathematics-IV

The Question Bank

A. Optimize the following NLPP considering , x1 , x2 , x3 ≥ 0 using Lagrangian Multiplier Method given
by:

SN Objective Function The Constraints The Solution

1. Z = 2x21 + x22 + 3x23 x1 + x2 + x3 = 20 x1 = 5, x2 = 11,

+10x1 + 8x2 + 6x3 − 100 x3 = 4, ZM in = 281

2. Z = 12x1 + 8x2 + 6x3 x1 + x2 + x3 = 10 x1 = 5, x2 = 3,

−x21 − x22 − x23 − 23 x3 = 2, ZM ax = 35

B Optimize the following unconstrained NLPP considering , x1 , x2 , x3 ≥ 0 using KT Conditions given

by:

SN Objective Function The Constraints The Solution

3. Max Z = 2x21 − 7x22 + 12x1 x2 2x1 + 5x2 ≤ 98 x1 = 44, x2 = 2,

λ = 100, ZM ax = 4900

4. Max Z = 8x1 + 10x2 − x21 − x22 3x1 + 2x2 ≤ 6 x1 = 4/13, x2 = 33/13,

λ = 206/33, ZM ax = 277/13

C. Solve the following LPP by the Big M Simplex Method

5. Max Z = −2x1 − x2 6. Max Z = 4x1 + 5x2 − 3x3 + 50

Subjected To Subjected To
3x1 + x2 = 3 x1 + x2 + x3 = 10
x1 + 2x2 ≤ 4 x1 − x2 ≥ 1
x1 , x 2 ≥ 0 2x1 + 3x2 + x3 ≤ 40
Ans: x1 = 1, x2 = 0, Z = −2 x1 , x 2 , x 3 ≥ 0
11 9 189
Ans: x1 = , x2 = , x3 = 0, Z =
2 2 2

1
 D Solve the following LPP by the Simplex Method

7. Max Z = 3x1 + 2x2 + 5x3 8. Min Z = x1 − 3x2 + 2x3

Subjected To Subjected To
x1 + 2x2 + x3 ≤ 430 3x1 − x2 + 3x3 ≤ 7
3x1 + 2x3 ≤ 460 − 2x1 + 4x2 ≤ 12
x1 + 4x2 ≤ 420 − 4x1 + 3x2 + 8x3 ≤ 10
x1 , x 2 x3 ≥ 0 x1 , x 2 , x 3 ≥ 0
Ans: x1 = 0, x2 = 100, x3 = 230, Z = 1350. Ans: x1 = 4, x2 = 5, x3 = 0, ZMin = −11

E. Find the Z−transform of following functions and indicate the respective region of convergence.

9. f (k) = 5k for k < 0.

z
Answer:- Z{f (k)} = is defined for |z| < 5.
(5 − z)

3k k≥0
10. f (k) = .
3−k k<0

8z 1
Answer:-Z{f (k)} = is defined for < |z| < 3.
(1 − 3z)(3 − z) 3

The Term Assignment

H sin6 z
1. Evaluate C dz where C : |z| = 3 by Cauchy Integral Formula and Cauchy Residue theorem.
 π 3
z−
2
7z − 2
2. Find all possible Laurents series of the function f (z) = about z = −1 and indicate
z(z − 2)(z + 1)
the region of convergence.
 
1 2 −2
3. Show that matrix A = −1 3 0  verifies Cayley Hamilton theorem and hence find A−1 .
 

0 −2 1
 
3 −1 1
4. Find the eigen values and vectors of matrix A = −1 3 −1.
 

1 −1 3
 
6 −2 2
5. Check whether the matrix A = −2 3 −1 is diagonalizable? If yes find the modal matrix M
 

2 −1 3
such that M −1 AM = D where D is the required diagonal form.

** Also add the above 10 questions of Question bank.

** Submit the work online on teams in PDF format indicating your roll number and name.