www.jntuworld.

com

Code No: D7508

R09
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech II - Semester Examinations, October/November 2011
OPERATIONS RESEARCH
(CONTROL SYSTEMS)
Time: 3hours Max. Marks: 60
Answer any five questions
All questions carry equal marks
---

1.a) Explain the importance of artificial variables.

b) Solve the following LPP problem by Big M method. [12]
Max Z=x1+2x2+3x3-x4
st x1+2x2+3x3=15
2x1+x2+5x3 > 20
x1+2x2+x3+x4=10
x1,x2,x3, x4>0

L D
2.a)
b)
R
What is meant by degeneracy in Transportation problem?
A product is produced by four factories A, B, C and D. The unit production costs

O
in them are Rs.2, Rs.3, Rs.1 and Rs.5 respectively. Their production capacities
are: Factory A-50 units, B-70 units, C-30 units and D-50 units. These factories

W
supply the product to four stores, demands of which are 25, 35,105 and 20 units
respectively. Unit transport cost in rupees from each factory to each store is given

U
in the table below.

B
T
Factories

N
A
Stores 1

2
10
2

4
8
3

6
7
4

11
5

J C
D
13
4
3
6
9
8
12
3
Determine the extent of deliveries from each of the factories to each of the stores
so that the total production and transportation cost is minimum. [12]

3.a) Write the Johnson algorithm for n jobs and two machines sequencing problem.
b) There are seven jobs, each of which has to go through the machines A and B in
the order BA. Processing times in hours are given as

Job 1 2 3 4 5 6 7
Machine A 3 12 15 6 10 11 9
Machine B 8 10 10 6 12 1 3

Determine a sequence of these jobs that will minimize the total elapsed time T.
Also calculate minimum total elapsed time with the resulting optimal sequence.
[12]

Contd……2

www.jntuworld.com
www.jntuworld.com

::2::

4. Solve the following LPP by dynamic programming approach. [12]

Max Z = 5 x1 + 3 x2
st 3 x1 + 5 x2 ≤ 15
5 x1 + 2 x2 ≤ 10, xi ≥ 0∀i

5.a) Mention drawbacks of Fibonacci method.

b) Minimize Y=x2-10 exp (0.1x) in the interval (-10, 5) by using Golden section
method. Show calculations for 6 cycles. [12]

6. Using Rosen Brock’s Search method, Min Y=2+(x12-x2)2+x22. Take starting

point as (-3,-4), s1=s2=0.5 and α=3, β= -0.5. Show calculations for complete two

7.
cycles.

Solve the following GP problem

Min f(X) = 20 x2 x3 x44+20x12 x3-1 +5x2 x32
L D [12]

Subject to 5 x2-5 x3-1 ≤ 1

10 x1-1 x23 x4-1 ≤ 1
xi >0 i=1 to 4.

O R [12]

8.a)
b)
W
Define simulation. Explain the various steps involved in the simulation process.
State the advantages and disadvantages of simulation.

U
[12]

N T ********

www.jntuworld.com