Total No.

of Pages:

7549

Register Number:
Name of the Candidate:

P.G DIPLOMA EXAMINATION, December 2014

(APPLIED OPERATIONS RESEARCH)

120: LINEAR, NONLINEAR AND DYNAMIC PROGRAMMING MODELS

Time: Three hours

Maximum: 100 marks

Answer any FIVE questions

Use of Statistical tables is permitted
1.

(5 x 20 = 100)

A person wants to decide the diet to meet the daily requirements of

proteins, fats, and carbohydrates at minimum cost. Four different
foods are available and the yields per unit of these are as follows:
Yield / Unit
Type of
Food

Proteins Fats Carbohydrates

1
3
2
2
4
2
3
8
7
4
6
5
Maximum
800
200
requirement
Formulate the problem as a LP model.
2. a.

b.

6
4
7
4
700

Cost /Unit
(M)
45
40
85
65

(20)

Solve the following LP problem graphically:

Minimize

z = 60x+40y

Subject to

30x+10y240
10x+10y160
20x+60y480
x , y0

(10)

Show that there is an unbounded solution to the following LP

problem:
Maximize

z = 4x1+x2+3x3+5x4

Subject to

4x1-6x2-5x3-4x4 -20
-3x1-2x2+4x3+x4 10
-8x1-3x2+3x3+2x4 20
x1, x2, x3, x4 0

(10)

7549
3. a.

b.
4. a.
b.

2
Solve the following problem by dual simplex method:
Minimize

z =2x1+2x2+4x3

Subject to

2x1+3x2+5x3 2
3x1+x2+7x3 3
x1+4x2+6x3 5
x1, x2, x3 0

(14)

Discuss the applications of duality theory.

(6)

Describe north west corner method of finding initial basic feasible

solution to a transportation problem.

(6)

A dairy firm has three plants located throughout a state. Daily milk
production of each plant is as follows:
Plant
I II III
6 1 10

Daily production of
milk in million litres
Consumption at various distribution centres are as follows:
Distribution Centre
1
2
3
4
7
5
3
2

Daily consumption of milk

in million litres
Cost of shipping one million litres of milk from each plant to each
distribution centre is as follows:
Distribution
Centres

5. a.

1
2
3
4
I
2
3
11
7
Plants II
1
0
6
1
III 5
8
15
9
Solve the above transportation problem by Vogels approximation
method to minimize cost.

(14)

A company has one surplus truck in each of the cities A,B,C,D and
E and one deficit truck in each of the cities 1,2,3,4,5 and 6. The
distance between the cities is as shown below:
1
2
3
4
5
6
A 12 10 15 22 18 8
B 10 18 25 15 16 12
C 11 10 3
8
5
9
D 6 14 10 13 13 12
E 8 12 11 7 13 10
Assign the trucks to minimize the distance covered by them.

(20)

7549
6. a.

3
As use Lagrangian multiplies to solve the following Non linear
Programming problem.
Optimize

z = 2x12 + x22 + 3x32 + 10x1+8x2+6x3-100

Subject to

x1+x2+x3=20
x1,x2,x30

Does the solution maximize or minimize the objective.

b.
7.

8.

Brief about Kuhn Tucker conditions

An oil company has 8 units of funds for exploration of three sites. If
oil is present at a site, the probability of finding it depends on the
amount allocated for exploiting the site, as given below:
Units of funds allocated
0
1
2
3
4
5
6
7
8
Site I
0.0 0.0 0.1 0.2 0.3 0.5 0.7 0.9 1.0
Site II
0.0 0.1 0.2 0.3 0.4 0.6 0.7 0.8 1.0
Site - III 0.0 0.1 0.1 0.2 0.3 0.5 0.8 0.9 1.0
The probability that oil exists at the sides 1,2 and 3 is 0.4, 0.3, and
0.2 respectively. Find the optimal allocation of funds
Describe the following:
i) Solution to quadratic programming problems.
ii) Bellmans principles of optimality

$$$$$$$

(16)
(4)

(20)
(14)
(6)