rtmnuonline.

com

TKN/KS/16 – 5972 2. (a) Explain various steps of the simplex method involved
in the computation of optimum solution to a linear
Third Semester Bachelor of Computer programming problem. 5
Application Examination (b) Solve the following LP problem using simplex
OPERATION RESEARCH – I method.
Paper - IV Maximize z = 4x1 + 3x2
subject to the constraint
Time : Three Hours ] [ Max. Marks : 50 2x1 + x2 i 1000

om
x1 + x2 i 800

e.c
N. B. : (1) All questions are compulsory and carry equal

lin
marks. x1 i 400

on
(2) Draw neat and labelled diagram wherever x2 i 700

nu
necessary.
x1 , x 2 j 0

m
.rt
5

w
1. (a) Discuss different steps for formulation and solving

w
the OR problem. 5 OR

w
(b) What is feasibility region ? Is it necessarty that it (c) Give a general linear programming problem. Explain
should always be a convex set ? 5 how you test a basic feasible solution is an optimal
OR solution or not. 5
(d) Solve the following LP problem using simplex

om
(c) Explain graphical model of solving a LP problem. method.

e.c
5 lin Maximize z = 6x1 + 4x2
(d) Solve the following LP problem by using graphical
on
subject to the constraint
method.
nu

2x1 + 3x2 i 30
m

Maximize Z = 80x1 + 120x2 3x1 + 2x2 i 24

.rt
w

subject to the condition x1 + x2 j 3

w

x1 + x2 i 9
w

x1 , x2 j 0
x1 j 2 5
x2 j 3
20x1 + 50x2 i 360
3. (a) Explain Mathematical model for transportation
x1 , x2 j 0 5 problem. 5

TKN/KS/16 – 5972 Contd. TKN/KS/16 – 5972 2 Contd.

www.rtmnuonline.com
rtmnuonline.com

(b) Determine the initial basic feasible soultion using 4. (a) State and discuss the methods for solving an
LCM and NWCR. assignment problem. How is Hungarian method is
Destinations better than other methods for solving an assignment
problem ? 5
D1 D2 D3 D4 Supply
(b) Five men available to do five different jobs. From
S1 21 16 15 3 11 past record, the time (in hour) that each man takes
to do job is known and given in the following table.
Source S2 17 18 14 23 13 I II III IV V

om
S3 32 27 18 41 19 A 2 9 2 7 1

e.c
lin
Demand 6 10 12 15 B 6 8 7 6 1

on
nu
5
C 4 6 5 3 1

m
.rt
OR D 4 2 7 3 1

w
w
w
(c) Explain Vogel's Approximation method for finding an E 5 3 9 5 1
initial basic feasible solution of a transportation
problem. 5 Find the assignment of men to job that will minimize
the total time taken. 5
(d) Following table gives the transportation cost in Rs.
from each warehouse to each market. OR

om
P Q R S Supply (c) What is an unbalanced assignment problem ? How
e.c these problems are solved to obtain the feasible
lin
A 6 3 5 4 22
on
solution ? Explain. 5
nu

Warehouse B 5 9 2 7 15
(d) Solve the following assignment problem
m
.rt

C 5 7 8 6 8 J1 J2 J3 J4 (Job)
w
w

Demand 7 12 17 9 45 W1 10 15 24 30
w

Find optimal schedule and minimum transportation Workers W2 16 20 28 10

cost. 5 W3 12 18 30 16
W4 9 24 32 18
5
TKN/KS/16 – 5972 3 Contd. TKN/KS/16 – 5972 4 Contd.

www.rtmnuonline.com
rtmnuonline.com

5. (a) What is model in OR ? List various classification

scheme of models. 2 12
(b) Give implicatins of following assumption in LP model.
(I) Linearity of the objective function and
constraints.
(II) Continuious veriable. 2 12
(c) What are the main characteristics of a transportation

om
problem ? 2 12

e.c
lin
(d) How would you deal with the assignment problem,

on
where the objective function is to be maximize ?

nu
1
22

m
.rt
w
w
w
om
e.c
lin
on
nu
m
.rt
w
w
w

TKN/KS/16 – 5972 5 530

www.rtmnuonline.com