Sp 5

Total No. of Pages : 3

7549

Register Number :
Name of the Candidate :

P.G. DIPLOMA IN APPLIED OPERATIONS RESEARCH EXAMINATION

MAY 2014.
120 LINEAR, NON LINEAR AND DYNAMIC PROGRAMMING MODELS
Time : Three hours

Maximum : 100 marks

Answer any FIVE questions.

(5 20 = 100)

All questions carry equal marks.

Use of statistical tables is permitted.
1.

(a)

A firm produces three products and these are processed on three different
machines. The processing time for one unit of each of the products and
the daily capacity of the machines are as follows:
Processing time in min/unit
Machine

Product 1

Product 2

Product 3

Machine capacity
min/day

M1

440

M2

470

M3

430

Profit per unit for product 1, 2 and 3 is Rs.4, Rs.3 and Rs.6 respectively.
Formulate the mathematical model for the problem to maximize the
profit assuming that all the products produced are consumed in the
market.
(10)
(b)

Solve the following LP problem by graphical method:

Maximize Z = 3x1 + 4 x 2
Subject to x1 + x 2 450
2x1 + x 2 600
x1 0 and x 2 0 .

2.

(a)

(10)

Define the following:

(i)

Basic feasible solution.

(ii)

Nondegenerate basic feasible solution.

(iii) Optimal solution.

(3 2 = 6)

Sp5

(b)

Solve by simple method the following LP problem.

Minimize Z = x1 3x 2 + 3x 3
Subject to 3x1 x 2 + 2x 3 7
2x1 + 4 x 2 12
4 x1 + 3x 2 + 8x 3 10
x1 , x 2 , x 3 0 .

3.

(14)

Solve the following L.P. problem by dual simplex method.

Minimize Z = 3x1 + 2x 2 + x 3 + 4 x 4
Subject to 2x1 + 4 x 2 + 5x 3 + x 4 10
3x1 x 2 + 7x 3 2x 4 2
5x1 + 2x 2 + x 3 + 6x 4 15
x1 , x 2 , x 3 , x 4 0 .

4.

(20)

(a)

Discuss least cost method of finding initial basic feasible solution to

transportation problem.
(4)

(b)

A company making air coolers has two plants located at Mumbai and
Kolkata with capacities of 200 units and 100 units per week respectively.
The company supplies the air coolers to its four showrooms at Ranchi,
Delhi, Lucknow and Kanpur with a maximum demand of 75, 100, 100
and 30 units respectively. Due to the difference in raw material cost and
transportation cost, the profit per unit in rupees differs and is as follows.
Ranchi

Delhi

Lucknow

Kanpur

Mumbai

90

90

100

110

Kolkata

50

70

130

85

Find the production programme to maximize the profit.

5.

(16)

Five wagons are available at stations 1, 2, 3, 4 and 5 which are required at

stations I, II, III, IV and V. The mileages are as given below:
I

II

III

IV

10

18

11

13

12

14

18

12

17

15

11

14

19

10

Assign the wagons for minimum total mileage.

(20)

7549

Sp5

6.

Optimize Z = 2x1 + 3x 2 x12 + x 22 + x 32

Subject to x1 + x 2 1
2x 1 + 3 x 2 6
x1 , x 2 0 .
Solve the above by applier KuhnTucker condition.
7.

In 18th century, a family travelled from their residence to a pilgrimage centre

for away. They had a choice of alternate routes and haltages between their
residence and the destinations. The costs of travel from one point to the other
enroute are as given below.
1

10

10

Find the route to minimize the total travelling cost.

8.

(20)

Discuss the following:

(a)

Lagrangian multipliers.

(b)

Wolfes NLP algorithm.

(10+10)

7549