You are on page 1of 2

# 10CSIIS661

USN

## Sixth Semester B.E. Degree Examination, June/July 2015

Operations Research
Max. Marks: 100

Time: 3 hrs.

## Note: Answer FIVE full questions, selecting

at least TWO questions from each part.

PART-A
1 a.
b.

"""'~
y

:~ ~

## Define: i) Feasible solution

ii) Feasible region
iii) Optimal solution.
.~llarks)
A manufacturer produces three models I, Il, In of certain product using raw IR.'i)i1tls A and
B Th e f4011'owmg ta blee gives
ei
th e d at a f4or th epro bl em.
~ ~
Requirement per unit
Raw material
Availability
III
I
Il
A
3
4000
2
5
B
6000
4
2
7
Minimum Demand
200
200
150
~~
Profit per unit (Rs)
30
20
50
A
(07 Marks)
Formulate the problem as a linear program model.
\
Using graphical method solve the LPP
Maximize Z = 5xl + 4X2
~

~~

Subject to

.g

i=

<0"
-:

.J:I

13,8

[j

10

~!

c.

.s H

g'~
~

if

x2~2,
2

1~ l~
~j

a.
b.

~i)

8' ~

8 "!,
!If 8
as

'i

c.

\:)

r" ;

/f;)V

UVariable.
lex method:

(04 Marks)

2~8

2~0
owing:
form of the LPP
olution of a'LPP
eneracy and un bounded solution with respect to simplex methods.

i~
~iii
a
t~ 3 t5 ~ lve the following LPP by Charne's big M method
.f.~ c; Maximize z 20x + 10x2

(to Marks)

(06 Marks)

l' 1 ~

Subject to:

~~

Xl +X2

= 150

xl~40

~
~

_I
4

8'

(07 Marks)

+8~(\$f6

~x

'31;

2Xl

DD
rr..
TTT
TIIT
T,,

'

Xl,X2~0

## Define slack variable and s

Solve the following LPP by.'
Maximize z = 6xl + 8x
Subjectto

R)'J "

6xl + 4X2 s 24
Xl + 2X2 ~ 6
-Xl +X2 ~l

~'I
g

KKG
GF
Fw
www
ww.
.ddr
rtttti
itt..e
eddu
u..i
inn

b.
a.
b.

where
Xl'X~2:020
Write procedure to solve LPP of two phase simplex method.

(tSMarks)
(OSMarks)

Explain the computational procedure of revised simplex method in standard form. (to Marks)
Explain the following:
i) Weak duality property
ii) Strong duality property
iii) Complementary solutions property
iv) Complementary optimal solution property.
(to Marks)

lof2

10CSlIS661
5

PART-B
User dual simplex method and solve the following LPP:
Maximize
z = 3xI + x2
Subject to: XI+ x2 ~ 1

a.

2xI +3x2

XI' x2 ~ 0
b. Explain the role of duality theory in sensitivity analysis.
c. Write any five key relationships between the primal and the dual problems.

Des:ti: D.
01

b.

g:

~ ~ ~

04

## Define the following ~espect

to games
i) Pay - off ~.
'~'ro - sum game
Solve the foll .
ame graphically

b.

40 ~

. 0.0<::'
c. ~ve

vO

Supply

(to Marks)

(10 Marks)

(03 Marks)

Player B

<0~

16 20
6 15
12 16
28 26
Ms L..-...!.-----'---L.1_1-1-15--l

DD
rr..
TTT
TIIT
T,,

a.

Player A

BI

B2

B3

22

Al

A, 16 10 24
(07 Marks)

~<:\$

## Solve the following assignment problem

Machine

~~

(~~S)

,r&~

KKG
GF
Fw
www
ww.
.ddr
rtttti
itt..e
eddu
u..i
inn
Origin

(10 Ma~
(OS ~~

1
2
3
4

ITB ITI IV

20

15 12 35
14 8 10
2 19 5
4 11 0

25
40
5

(to Marks)

a.
b.

Write the outline of a basic table search algorithm. Explain it with the help of a minimum
spanning tree problem with constraints.
(10 Marks)
Write short notes on: i) simulated annealing
ii) Genetic algorithms.
(10 Marks)

*****
20f2