## Operation Research Question Paper of 3rd Semester B.Com Download Previous Years Question Paper 3

• Monday, September 05, 2016
• • ,
• No comments

Roll No.
Total No. of Questions : 07
B.Com(Sem.–3rd)
OPERATION RESEARCH
Subject Code : BCOP-304
Paper ID : [B1127]
Time : 3 Hrs.
INSTRUCTION TO CANDIDATES :
1. SECTIONA is COMPULSORY consisting of TEN questions carrying
TWO marks each.
2. SECTION-B contains SIX questions carrying TEN marks each and students has to attempt any FOUR questions.
SECTION-A
l. Write briefly :
(a) Prove that the dual of the given primal, is the primal.

(b) Write the dual of
Maximize Z = 5x1 – 3x2 + 4x3
s.t. 2x1 + 6x2 – x3 = 6
x1 + 6x2 – 4x3  6
2x1 – x2 + x3 = 7
x1  0, x2, x3 – unrestricted.

(c) Explain the four elements that characterize sequencing problem.

(d) Explain the term, total float and independent float.

(e) Is the union of two convex set convex? Justify your answer.

(f) Find the range of values of p and q which will render entry (2, 2) a saddle point for the game :

Player B
2        4       5
Player A               10      7       q
4        p      6

(g) What do you mean by degeneracy in transportation problem?

(h) In a transportation problem with m-sources and n-destination, how many basic feasible solutions are available and why? Give reasons for

(

i) While solving an LPP, minimize Z = CX s.t., AX = b, X 0, what
indicates “alternate solution”.

(j) Solve graphically

Minimize Z = 2x1 + x2
s.t. x1 – x2  0
– x1 + 2x2  1
2x1 – x2  1; x1, x2 0.
SECTION-B

2. Solve the following problem using Big-M method :

Minimize Z = 3x1 + x2 – 2x3
s.t. 4x1 + 2x2 – x3 < 1
x1 + x2 + x3 = 5
2x2 + 4x3 = 3; x1, x2, x3 > 0.

3. State and Prove Weak Duality Theorem.

4. A company has 4 machines on which 3 jobs are to be made. Each job can be assigned to one and only one machine. The cost of each job is given in following table. What is the job assignment which will minimise the cost ? Also write the dual of the problem

w       x        y        x        machines
A       5        9        8        1
B       18      24      17      19
C       10      15      19      20

5. A small workshop undertaking repair of damaged cars has one denter and one painter. Presently there are 6 cars needing repair. The following estimates in hours of time needed for denting and painting on the cars are available.

 Car 1 2 3 4 5 6 Denting Time 4 7 3 12 11 9 Painting Time 11 7 10 8 10 13

What is the sequence that completes all the jobs in minimum time ? What is the corresponding schedule of jobs ?

6. M/s XYZ consultants have identified the following ten major activities in a project to promote a new product,

 Activity A B C D E F G H I J Predecessors - A A A B,C,D A D A H G Duration (week) 3 6 4 3 1 4 4 5 1 2

(a) Draw a PERT network to represent this project.
(b) What is the earliest time to complete project?
(c) Give the early and late start schedule for each activity.

7. Solve the following transportation problem to get an optimum solution :

D1      D2     D3     D4      Availability
O1               2       3        1        2                40
O2               5        4        2        6                 60
O3               3        9        7       2                80

Demand      10      40     60     20