Master of Computer Application I (Science) Examination:
Oct Nov 2016 Semester I (New CBCS)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR U
49
Monday
21/11/2016
10.30 AM
to
01.00 PM
Operations Research
C
SCT 1.2
Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Select most correct alternatives 10
The objectives function constraints are linear relationship between
Variables Constraints
Function None of these
A slack variables are used to convert the inequalities of the type
into equation
One can find the initial basic feasible solution by using
VAM MODI
Optimality test None of the above
VAM stands for
Vogeal's Approximation
Method
Vogel's Approximation Method
Vange's Approximation
Method
Vegel's Approximation Method
The sequence of critical activities in a network is called
Critical path Critical walk
Critical chain Critical cycle
A s-t cut is a partition of the vertices
is the shortest possible time in which the activity can be finished
Pessimistic time Optimistic time
Most likely time Optimistic time
A feasible solution to a transportation problem containing m origins n
destinations is said to be
Independent Degenerate
Non-degenerate Both a b
Graphic method can be applied to solve a LPP when there are only
variable
One More than one
Two Zero
10) In simplex method, we add variables in the case of
Stack variable Surplus variable
Artificial variable None of these
Fill in the blanks 04
If S T are two convex sets then 2S 3T is
Using method we can never have an unbounded solution.
If the primal problem as an unbounded optimum solution then the dual
problem has
Find as t path P where each edge has
Page 1 of 2
Q.2 Write the limitation of linear programming
Define slack surplus variable
Explain the need of artificial variables.
Define general LPP write in a matrix form
03
04
04
03
Q.3 Solve the following problem by simplex method.
Max Z 3x 2y
Subject to the constraints
Explain algorithm of Big M Method
07
07
Q.4 Use Big M method to solve
Max z 3x y
Subject to constraints
Explain algorithm of Hungarian assignment problem method.
07
07
Q.5 A project has the following time schedule
Activity Time in month
1-2 2
1-3 2
1-4 1
2-5 4
3-6 8
3-7 5
4-6 3
5-8 1
6-9 5
7-8 4
8-9 3
Construct PERT network compute
Total float for each activity
Critical path its duration
The dual of the dual of a given primal is the primal
10
04
Q.6 Five men are available to do five different jobs from past records, the time
in hours) that each man takes to do each job is given in the following table
Job
man
A I II III IV V
2 9 2 7 1
B 6 8 7 6 1
C 4 6 5 3 1
D 4 2 7 3 1
E 5 3 9 5 1
Define Matroids with example.
08
06
Q.7 Explain the Application Areas of PERT/CPM Techniques
Explain Ford Fulkerson Algorithm
07
07