"Vidya Digital Library"

c 61460 (Pages: 6) Name ...................................... ~!!.

Reg. No................................... .

SIXTH SEMESTER B.TECH. (ENGINEERING) DEGREE EXAMINATION

APRIL 2014
(2009 Scheme)
EE 09 L 02-NUMERICAL ANALYSIS AND OPTIMISATION TECHNIQUES
(Regular/Supplementary/Improvement)
Time : Three Hours Maximum : 70 Marks
Part A
Answer all questions.
All questions carry equal marks.
I. (a) Show that the nth differences of a polynomial of nth degree are constant.

(b) Find a root of x 3 - 4x - 9 = 0 correct to two decimal places that lies between 2 and 3 by using
bisection method.
(c) Using Picards method, obtain a solution upto the third approximations of the equation
dy .
dx = y+x, such thaty = 1 when x = 0.
(d) Define:

(i) Basic solution.

(ii) Basic feasible solution.
(e) What are the different methods to obtain an initial basic feasible solution in Transportation
Problem?
(5 x 2 = 10 marks)
PartB

Answer any four questions.

Each question carries 5 marks.

II. (a) Find a root of the equation .x log10 x = 1.2 by regula-falsi method correct to four decimal
places.
(b) Apply Gauss-Seidal iteration method to solve the equations :

20x + y- 2z =17
3x+20y-z=-18
2x-3y+ 20z = 25

Turn over

"Vidya Digital Library"

"Vidya Digital Library"

2 c 61460
1
(c) Evaluate J1d_;x by the trape~oidal rule by considering Eight sub-intervals of the interval
0

. [0, 1]. Hence find an approximate value of log 2.

(d) Construct the dual ofL.P.P.:
Maximize Z = 3x1 + 17x 2 + 9x3
subject to x1 - x2 + x3 ::::: 3

and xv x2, x3 ::::: 0.

(e) Find the initial basic feasible solution to the following Transportation Problem:
Destination

1 2 3 4 Supply
Origin
A 7 2 5 5 30
B 4 4 6 5 15
c 5 3 3" 2 10
D 4 -1 4 2 20
Demand 20 25 15 15

(f) Solve the following assignment problem inorder to minimize the total cost. The cost matrix
given below gives the assignment cost when different operators are assigned to various
machines.

OPERATORS

I II III IV v
A 30 25 33 35 36

MACHINES B 23 29 38 23 26
c 30 27 22 22 22

D 25 31 29 27 32

E 27 29 ~0 24 32

(4 x 5 = 20 marks)

"Vidya Digital Library"

"Vidya Digital Library" Part C
Answer Section A or Section B of each question.
III. A. (i) Solve by Gauss-Jordan method:

x+y+z=9
2x-3y+4z=13
3x+4y+5z = 40.

(5 marks)
(ii) Solve the system of equations :

2x-3y+10z = 3
:-x +4.)1 + 2z = 20
5x+2y+z = -12.

by triangularization method:
(5 marks)
Or

B. (i) Using Newton's backward interpolation formula, find the interpolating polynomial that
approximates the function given by the following table :

X 0 1 2 3

f(x) 1 3 7 13.

Hence find f (2.5).

(5 marks)
(ii) Given the data :

X 5 7 11 13 17

f(x) 150 392 1452 2366 5202

Find {(9) using Newton's divided difference formula.

(5 marks)

Turn over

"Vidya Digital Library"

"Vidya Digital Library"

4 c 61460

IV. A. (i) Solve dy =i + x, y (0) =1 using Taylor's series method and compute y (0.1), y (0.2) and
dx
y (0.3).
(5 marks)

6
dx
(ii) Evaluate J -
0 1 +X
2 by using the Simpson's (%}th rule ..

(5 marks)

Or
B. (i) Using Euler's method, find an approximate value of y corresponding to x = 1, given that
dy
dx =x + Y andy = 1 when x = 0.
(5 marks)

(ii) Apply Runge-Kutta method to find approximate value of y for x = 0.2, in steps of 0.1, if
dy 2
dx = x + Y , given that y = 1 when x = 0.

(5 marks)

V. A. Solve the following L.P.P. by using simplex method:

Maximize Z = 3x1 + 5x2

subject to

x1 +x2 :::;; 2
2x1 +5x2 :::;; 10
8x1 +3x2 :::;; 12
x1 , x 2 ~ 0.

(10 marks)
Or

"Vidya Digital Library"

"Vidya Digital Library"

5 c 61460
B. Solve the following LP.P. by Charne's method:

Maximize . Z = 6x1 - 3~ + 2x3

subject to

2x1 + x 2 + x 3 s; 16
3x1 + 2x2 + x 3 s; 18
x 2 -2x3 ~ 8
x1 , x 2 , x 3 ~ 0.

.
(10 marks)
VI. A. A company has 5 Jobs to be done on five machines. Any Job can be done on any machine. The
cost of doing the Jobs in different machines are given below. Assign the Jobs for different
machines so as to minimize the total cost.

Machines
Jobs
A B c D E
1 13 8 16 18 19

2 9 15 24 9 12

3 12 9 4 4 4
4 6 12 10 8 13

5 15 17 18 12 20

(10 marks)

Or

Turn over

"Vidya Digital Library"

"Vidya Digital Library" It

6 c 61460
B. Solve the following transportation problem: '
DESTINATIONS

A B c D Supply

1 1 5 3 3 34
z
~

~
~
2 3 5 1 2 15
~
0 ' 3 0 2 2 3 12

4 2 7 2 4 19

Demand 21 25 17 17 80

(10 marks)

[4 x 10 = 40 marks]

"Vidya Digital Library"