CBCS/B.Sc./Programme/6th Sem.

/MTMGDSE03T/2022

WEST BENGAL STATE UNIVERSITY

B.Sc. Programme 6th Semester Examination, 2022

MTMGDSE03T-MATHEMATICS (DSE2)
NUMERICAL METHODS
Time Allotted: 2 Hours Full Marks: 50
The figures in the margin indicate full marks.
Candidates should answer in their own words and adhere to the word limit as practicable.
All symbols are of usual significance.

Answer Question No. 1 and any five from the rest

1. Answer any five questions from the following: 2×5 = 10
(a) Write down the relations of Central difference operator, G and Average operator,
P with the shift operator E .
(b) Obtain two consecutive integers between which there is a root of x 3  x  5 0 .

(c) Write down the number 2 correct upto 5 significant figures and find relative error.
3
(d) Why is the Newton-Raphson method for computing a simple root of an equation
f ( x ) 0 called method of tangents?
(e) Construct a linear interpolation for f (x ) with f (1) 3 and f (2) 5 .
(f) Show that ' log f ( x) log [1  ' f ( x ) f ( x)]
(g) Find the value of f (0.2) using the table of values of f (x )
x 0.2 0.4 0.6
f ( x) 1.6596 1.6698 1.6804
2
(h) Using trapezoidal rule compute ∫ f ( x) dx . Given
0

x 0 1 2
f ( x) 1.6 3.8 8.2

2. (a) Find a real root of the equation 3 x  cos x  1 0 correct to two significant figures 4
by using Newton Raphson method.
(b) Discuss method of bisection for computing a real root of an equation f ( x ) 0. 4

3. (a) Find Lagrange’s interpolation polynomial for the function f ( x ) sin S x , when 3+1+1
1 1 S
x0 0 , x1 , x2 . Also compute the value of sin and estimate the error.
6 2 3
(b) Find f (5) , given that f (0) 2 , f (1) 4, f (2) 6 , f (3) 10 and third 3
difference being constant.

6273 1
Turn Over
CBCS/B.Sc./Programme/6th Sem./MTMGDSE03T/2022
4. (a) Solve the equation 6
2x  3 y  z 9
x  2 y  3z 6
3x  y  2 z 8
by the method of matrix factorization
(b) Round off the number 40.3586 and 0.0056812 to four significant digits. 2

5. (a) Find the missing terms in the following table: 4

x 0 1 2 3 4 5
y 1 5 – 121 – 781
(b) Use of Stirling interpolation formula prove that 4
d 2 1
f ( x) [ f ( x  1)  f ( x  1)]  [ f ( x  2)  f ( x  2)] ,
dx 3 12
considering the differences upto third order.

6. (a) Compute f (0.5) from the following table 4

x 0 1 2 3
f ( x) 1 2 11 34
(b) Show that n th order difference of a polynomial of degree n are constant. Does the 4
converse of the result true?

1
1 1
7. (a) Evaluate numerically the integration
∫ 1  x dx , by Simpson’s
0
3
rd rule taking 6 4

equal subintervals.
(b) If f ( x ) is a polynomial of degree 2, prove that 4
1

∫ f ( x)dx
0
[5 f (0)  8 f (1)  f (2)] 12 .

8. (a) Compute by the method of fixed point iteration method the positive root of the 4
equation x 2  x  0.1 0 correct upto three significant figures.
(b) Find the real root of the equation x 3  x  1 0 by Regula-Falsi method correct 4
upto two significant figures.

9. (a) Use Euler’s method with h dy 5

0.2 to find the solution of 2 x  y , y (0) 1 at
dx
x 0.4 .
(b) Find the location of the positive roots of x 3  9 x  1 0 , and evaluate the smallest 3
one by bisection method correct to two decimal places.

N.B. : Students have to complete submission of their Answer Scripts through E-mail / Whatsapp to
their own respective colleges on the same day / date of examination within 1 hour after end of
exam. University / College authorities will not be held responsible for wrong submission (at
in proper address). Students are strongly advised not to submit multiple copies of the same
answer script.
––––×––—

6273
2
CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2022

WEST BENGAL STATE UNIVERSITY

B.Sc. Programme 6th Semester Examination, 2022

MTMGDSE04T-MATHEMATICS (DSE2)
LINEAR PROGRAMMING
Time Allotted: 2 Hours Full Marks: 50
The figures in the margin indicate full marks.
Candidates should answer in their own words and adhere to the word limit as practicable.
All symbols are of usual significance.

GROUP-A
Full Marks-10

1. Answer any five questions from the following: 2×5 = 10

(a) Is the set X {( x, y ) : x 2  y 2 † 4} is convex? Justify your answer.
(b) In the following equations find the basic solution with x3 as the non-basic variable
x1  4 x2  x3 3
5 x1  2 x2  3x3 4
(c) Find a basic feasible solution of the equations x1  x2  x3 8 , 3 x1  2 x2 18
(d) Find the extreme points, if any, of the set S {( x, y ) : 2 x  3 y 6}
(e) Draw the convex hull of the points (0, 0), (0, 1), (1, 2), (1, 1), (4, 0) .
(f) Write down the dual of the following L.P.P.:
Maximize Z 3 x1  5 x2
Subject to x1  2 x2 † 5
x1  x2 7
x1 , x2 – 0
(g) Determine the position of the point (–1, 2, 5, 3) relative to the hyperplane
4 x1  6 x2  x3  3x4 4
(h) Find the number of basic feasible solutions of the following L.P.P.:
Maximize Z 2 x1  3 x 2
Subject to x1  x 2 – 2
x1  x 2 † 1
x1 , x2 – 0
(i) What is the criterion for no feasible solution in two-phase method?

6321 1 Turn Over

CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2022

GROUP-B
Full Marks-40

Answer any five questions from the following 8×5 = 40

2. (a) Solve the following L.P.P using graphical method 4
Maximize Z 2 x1  x2
Subject to 4 x1  3 x2 † 12
4 x1  x2 † 8
4 x1  x2 † 8
x1 , x2 – 0
(b) Food X contains 6 units of vitamin A and 7 units of vitamin B per gram and costs 4
12 p./gm. Food Y contains 8 units of vitamin A and 12 units of vitamin B per gram
and costs 20 p./gm. The daily requirements of vitamin A and B are at least 100
units and 120 units respectively. Formulate the above as an L.P.P. to minimize the
cost.

3. (a) Use Simplex method to solve the L.P.P. 4

Maximize Z x1  2 x2  4 x3
Subject to 3 x1  5 x2  2 x3 † 6
4 x1  4 x3 † 7
2 x1  4 x2  x3 † 10
x1 , x2 , x3 – 0
(b) Show that the vectors (1,  2, 0), (3, 1, 2), (5,  1, 4) form a basis in E 3 . 4

4. (a) Prove that the set of all convex combinations of a finite number of points is a 5
convex set.
(b) Find a supporting hyperplane of the convex set 3
S {( x , y ) : x  2 y † 4, 3 x  y † 6, x – 0, y – 0}

5. (a) x1 1, x2 1, x3 1, x4 0 is a feasible solution of the system of equations 5

x1  2 x2  4 x3  x4 7
2 x1  x2  3 x3  2 x4 4
Reduce the feasible solution to two different basic feasible solutions.
(b) Prove that a hyperplane is a convex set. 3

6. (a) Obtain a basic feasible solution of the following L.P.P. from the feasible solution 4
(2, 3, 1)
Maximize Z x1  2 x2  4 x3
Subject to 2 x1  x2  4 x3 11
3 x1  x2  5 x3 14
x1 , x2 , x3 – 0

6321 2
CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2022

(b) Prove that the intersection of two convex sets is also a convex set. 4

7. (a) Solve by Charnes Big M-method the following L.P.P. 6

Maximize Z 4 x1  x2
Subject to 3 x1  x2 3
4 x1  3 x2 – 6
x1  2 x2 † 4
x1 , x2 – 0
(b) Discuss whether the set of points (0, 0), (0, 1), (1, 0), (1, 1) on the xy -plane is a 2
convex set or not.

8. (a) Prove that dual of a dual is a primal. 4

(b) Obtain the dual problem of the following L.P.P. 4
Maximize Z  x1  3x2
Subject to 2 x1  x2 † 1
3 x1  4 x2 † 5
x1  6 x2 † 9
x1 , x2 , x3 – 0

9. (a) Find the points which generate the convex polyhedron 3

S {( x1 , x2 ) ± E 2 : x1  2 x2 † 4, x1  2 x2 † 2, x1 – 0, x2 – 0}
(b) Use two-phase method to solve the following L.P.P. 5
Maximize Z 3 x1  5 x2
Subject to x1  2 x2 – 8
3 x1  2 x2 – 12
5 x1  6 x2 † 60
x1 , x2 – 0

N.B. : Students have to complete submission of their Answer Scripts through E-mail / Whatsapp to
their own respective colleges on the same day / date of examination within 1 hour after end
of exam. University / College authorities will not be held responsible for wrong submission
(at in proper address). Students are strongly advised not to submit multiple copies of the
same answer script.

––––×––—

6321 3 Turn Over

CBCS/B.Sc./Programme/6th Sem./MTMGDSE03T/2021

WEST BENGAL STATE UNIVERSITY

B.Sc. Programme 6th Semester Examination, 2021

MTMGDSE03T-MATHEMATICS (DSE2)
NUMERICAL METHODS
Time Allotted: 2 Hours Full Marks: 50

The figures in the margin indicate full marks.

Candidates should answer in their own words and adhere to the word limit as practicable.
All symbols are of usual significance.

Answer Question No. 1 and any five from the rest

1. Answer any five questions from the following: 2×5 = 10
(a) Construct a linear interpolation for f (x) with f (1)  3 and f (2)  5 .
4

 2x dx , by Simpson’s 1 formula and comment on the result.

3
(b) Compute
3
0

3
(c) Derive an iteration formula for computing a , using Newton Raphson method.
(d) What is the condition of convergency of Gauss-Jacobi iteration to solve the system
of n linear equations? Is this condition both necessary and sufficient?

(e) Show that the equation x 2  ln x  0 has exactly one root in the interval  1 , 1 .
3 

(f) If 0.667 be an approximate value of 2 , find the percentage error.

3
(g) What do you mean by Numerical Differentiation?
(h) Show that 2 cos 2 x  4 cos 2 x where interval of differencing is  .
2
(i) Define the terms absolute and relative errors.

2. Explain the Newton-Raphson method for computing a simple real root of an 4+1+1+2
equation f ( x)  0 . When does the method fail? Can we apply this method to the
1
equation x 2  x   0 ? Justify your answer.
4

3. (a) In order to find the root of x3  x  1  0 , near x  1 which of the following 2+2
iteration functions give convergent sequences:
x 1 x 1
(i) x  (ii) x 
x2 x
(b) Apply the method of bisection to find a real root up to two significant digits of the 4
equation x3  3x  5  0 .

6273 1 Turn Over

CBCS/B.Sc./Programme/6th Sem./MTMGDSE03T/2021

4. (a) Use Lagrange’s interpolation to find the value of f (x) for x  0.4 using the table. 5
x 0.3 0.5 0.6
f (x) 0.61 0.69 0.72

(b) Find 4 f ( x) , where f ( x)  (3x  2) ( x  2)( x  1) (5x  1) and the interval of 3

differencing is unity.

5. What is interpolation? Deduce Newton’s forward difference interpolation formula 8

without error term.

6. (a) Given the following table: 2+3

x 0 5 10 15 20
f (x) 1.0 1.6 3.8 8.2 15.4

Construct the difference table and compute f (20) .

(b) If f ( x)  ax , show that ( E  E  1) f ( x)  2 f ( x) . 3

2
1
7. (a) Calculate  ( x  x ) dx
1
up to four significant figures by Simpson’s 1 rule taking
3
4

4 intervals.
(b) Obtain trapezoidal rule for numerical integration without the error term. 4

8. Solve the system of equations by LU decomposition method: 8

3x  4 y  2 z  15 , 5x  2 y  z  18 , 2 x  3 y  2 z  10

9. Deduce Lagrange’s interpolation formula and also prove that Lagrangian functions 8
are invariant under linear transformation.

10.(a) For any positive integer k , show that 4

k
k 
 yn   (1)i   yn  i
k

i0 i
 being the backward difference operator.
(b) What do you mean by ‘ round off ’ errors in numerical data? Show how these errors 4
are propagated in a difference table.

N.B. : Students have to complete submission of their Answer Scripts through E-mail / Whatsapp to
their own respective colleges on the same day / date of examination within 1 hour after end of
exam. University / College authorities will not be held responsible for wrong submission (at
in proper address). Students are strongly advised not to submit multiple copies of the same
answer script.
––––×––—

6273 2
CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2021

WEST BENGAL STATE UNIVERSITY

B.Sc. Programme 6th Semester Examination, 2021

MTMGDSE04T-MATHEMATICS (DSE2)
LINEAR PROGRAMMING
Time Allotted: 2 Hours Full Marks: 50
The figures in the margin indicate full marks.
Candidates should answer in their own words and adhere to the word limit as practicable.
All symbols are of usual significance.

Answer Question No. 1 and any five from the rest

1. Answer any five questions from the following: 2×5 = 10

(a) Find the extreme points of the following convex set S  {( x , y) : y 2  4 x} .
(b) Find a supporting hyperplane of the convex set
S  {( x , y) : x  2 y  4 , 3x  y  6 , x  0 , y  0}
(c) In the following equations find the basic solution with x3 as the non-basic variable.
x1  4 x2  x3  3
5x1  2 x2  3x3  4
(d) Is (2 , 0) a feasible solution of the following LPP?
Maximize Z  x1  3x2
Subject to 3x1  6 x2  8
5x1  2 x2  10
x1 , x2  0
(e) Write the following problem in a standard form:
Maximize Z  x1  x2  x3
Subject to | x1  x2  x3 |  2
x1  x2  x3  3
x1 , x2 , x3  0
(f) When a basic solution is said to be degenerated?
(g) A hyperplane is given by x  3 y  2 z  9 . In which half spaces the points (1, 2 , 4)
and (3 , 1 ,5) lie?
(h) Give an example of a non-convex set. Explain why it is non-convex.

6321 1 Turn Over

CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2021

(i) Find the number of basic feasible solution of the following LPP:
Maximize Z  2 x1  3x2
Subject to x1  x2  2
x1  x2  1
x1 , x2  0

2. (a) Find all basic feasible solution of the following system of equations. 4
x1  x2  x3  2 ,
2 x1  x2  x3  3
(b) Show that (1, 2 , 1) is a feasible solution of the system of equations. 4
x1  x2  2 x3  1
x1  2 x2  x3  4
x1 , x2 , x3  0
Reduce the feasible solution to a basic feasible solution.

3. (a) Solve: 4
Maximize Z  2 x1  3x2
Subject to x1  x2  2
2 x1  2 x2  8
x1 , x2  0
(b) Food X contains 6 units of vitamin A and 7 units of vitamin B per gram and costs 4
12 p./gm. Food Y contains 8 units of vitamin A and 12 units of vitamin B per gram
and costs 20 p./gm. The daily requirements of vitamin A and B are at least 100 units
and 120 units respectively. Formulate the above as an L.P.P. to minimize the cost.

4. (a) If the feasible region of a linear programming problem is strictly bounded and 4
contains a finite number of extreme points then prove that the objective function of
the linear programming problem assumes its optimal value at an extreme point of
the convex set of feasible solutions.
(b) Show that the feasible solution x1  1, x2  1, x3  0 , x4  2 to the system 4

x1  x2  x3  2
x1  x2  3x3  2
2 x1  4 x2  3x3  x4  4
x1 , x2 , x3 , x4  0
is not basic.

5. (a) Prove that the set of all convex combinations of a finite number of points is a convex 5
set.

6321 2
CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2021

(b) Give an example of 3

(i) Convex hulls in E 2 and E 3
(ii) Convex polyhedron in E 2
(iii) Simplex in zero and one dimension.

6. (a) Prove that in a linear programming problem the optimal hyperplane is a supporting 4
hyperplane to the convex set of feasible solution.
(b) Find a supporting hyperplane passing through (7 ,  1) of the convex set 4
X  {( x1 , x2 ) : x12  x22  25} .

7. Solve the following L.P.P. using duality theory. 8

Maximize Z  4 x1  3x2
Subject to x1  6
x2  8
x1  x2  7
3x1  x2  15
 x2  1
x1 , x2  0

8. (a) Solve by Charnes Big M-method the following L.P.P. 6

Minimize Z  4 x1  2 x2
Subject to 3x1  x2  27
x1  x2  21
x1  2 x2  30
x1 , x2  0
(b) Discuss whether the set of points (0 , 0) , (0 , 1) , (1, 0) , (1, 1) on the xy -plane is a 2
convex set or not.

9. (a) Given the L.P.P. 5

Maximize Z  2 x1  3x2  4 x3
Subject to x1  5x2  3x3  7
2 x1  5x2  3
3x2  x3  5
x1 , x2  0
x3 is unrestricted in sign. Formulate the dual of the L.P.P.
(b) Prove that if any variable of the primal problem be unrestricted in sign, then the 3
corresponding constraint of the dual will be equality.

6321 3 Turn Over

CBCS/B.Sc./Programme/6th Sem./MTMGDSE04T/2021

10.(a) If for a basic feasible solution xB of a linear programming problem maximize 5

z  cx , subject to Ax  b and x  0 , we have z j  c j  0 for every column a j of
A , then prove that xB is an optimal solution.
(b) Check whether x  5, y  0 , z  1 is a basic solution of the system of equations. 3
x  2y  z  4 ,
2 x  y  5z  5

N.B. : Students have to complete submission of their Answer Scripts through E-mail / Whatsapp to
their own respective colleges on the same day / date of examination within 1 hour after end of
exam. University / College authorities will not be held responsible for wrong submission (at in
proper address). Students are strongly advised not to submit multiple copies of the same
answer script.

––––×––—

6321 4