Sem - VI , Paper - 8 , Model Paper
SECTION - A
I.
Answer any Five questions: 5
X 3=15M
1.
Define OR & Explain its scope of OR.
2.
Explain the procedure of VAM method.
3.
Explain the procedure of Big M-Method.
4.
Solve the following LPP graphically
Min
z= -6X1-4X2
subject to the constraints 2X1+3X2 >= 30
, 3X1+2X2 <=24 , X1+X2 >=3 and X1
, X20
.
5.
State and prove fundamental theorem of LPP.
6.
Explain the concept of Travelling salesman problem.
7.
Concept of Transhipment problem.
8.
Explain sequencing problem.
SECTION
– B
Answer
all Three Questions:
3 X 15 = 45
9.(a).
I. When artificial variables are used. Explain Two Phase method of solving LPP.
II. Explain the procedure of
Graphical method.
(OR)
(b). Solve the following LPP
Min Z = 12X1+20X2 subject
to the constraints 6X1+8X2 >=100 , 7X1+12X2 >=120
and X1 , X2 >=0.
and X1 , X2 >=0.
10.(a).I. Define Unbalanced Transportation problem with
example.
II. Explain Degeneracy in
transportation problem, how it is resolved.
(OR)
(b). Obtain an optimum basic feasible
solution to the following Transportation
problem
problem
D1
|
D2
|
D3
|
Availabilities
|
|
O1
|
2
|
4
|
1
|
40
|
O2
|
6
|
3
|
2
|
50
|
O3
|
4
|
5
|
6
|
20
|
O4
|
3
|
2
|
1
|
30
|
O5
|
5
|
2
|
5
|
10
|
Requirements
|
50
|
60
|
40
|
11.(a).
Define Assignment problem. Explain
Hungarian method for an unbalanced Assignment problem.
(OR)
(b). Find the sequence that minimizes the
total elapsed time required to complete the following jobs. Also find idle time
for machines M1 , M2 .
Jobs
|
A
|
B
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
M1
|
2
|
5
|
4
|
9
|
6
|
8
|
7
|
5
|
4
|
M2
|
6
|
8
|
7
|
4
|
3
|
9
|
3
|
8
|
1
|
Comments
Post a Comment