STUPIDSID
1 (a)
Old hens can he brought at Rs.50/- each and young hens can be brought at Rs.l00/- each. The old hens lay 3 eggs/week and young hens 5/week. Each egg cost 2 Rs. A hen cost
Rs. 5/week to feed. if a person has only Rs.2000 to spend for hem. Formulate the problem to decide how many of each kind of hens should he buy? And he cannot house more than 40 hens. formulate the problem a LPP model
10 M
1 (b)
Solve the following LPP by Graphical method Zmax =3x1+4x2
subject to constrains,
5x1+4x2\le 200.
3x1+5x2\le150
5x1+4x2\ge 100
8x1+4x2\ge20
subject to constrains,
5x1+4x2\le 200.
3x1+5x2\le150
5x1+4x2\ge 100
8x1+4x2\ge20
10 M
2 (a)
Solve the following LPP using simplex method
Z max=10x1+5x2
subject to constrains,
4x1+5x2\le100
5x1+2x2\le 80
x2& x2,/sub> \ge0
Z max=10x1+5x2
subject to constrains,
4x1+5x2\le100
5x1+2x2\le 80
x2& x2,/sub> \ge0
8 M
2 (b)
Solve the given problem by using Big m
Zmin=5x1+3x2
subject to constraints,
2x1+4x1\le12
2x1+2x2=10
5x1+2x2\ge10
x1&x2\ge0
Zmin=5x1+3x2
subject to constraints,
2x1+4x1\le12
2x1+2x2=10
5x1+2x2\ge10
x1&x2\ge0
12 M
3 (a)
Find the optimality for given problem and initial solution by using VAM method
| Destination \Origin | W1 | W2 | W3 | W4 | Supply |
| F1 | 2 | -2 | 2 | 1 | 3 |
| F2 | 10 | 8 | 5 | 4 | 7 |
| F3 | 7 | 6 | 6 | 8 | 5 |
| Demand | 4 | 3 | 4 | 4 |
10 M
3 (b)
A AML company has 5 tasks has 5 tasks and persons to perform. Determine the optimal assignment and to minimize the total cost.
| Jobs | Machine | ||||
| A | B | C | D | E | |
| p | 6 | 7 | 5 | 9 | 4 |
| Q | 7 | 5 | 10 | 9 | 6 |
| R | 5 | 4 | 3 | 6 | 5 |
| S | 8 | 3 | 5 | 6 | 4 |
| T | 4 | 7 | 5 | 6 | 6 |
10 M
4 (a)
A travelling salesman has to visit 4 cities. He wishes to start from a particular city, visit each city once and return to his starting point find the least cost route
\[\begin{matrix} A &B &C &D &E \end{matrix}\\\begin{matrix} A\\B \\C \\D \\E \end{matrix}\begin{bmatrix} \infty &4 &10 &14 &2 \\12 &\infty &6 &10 &4 \\16 &14 &\infty &8 &14 \\24 &8 &12 &\infty &10 \\2 &6 &4 &16 &\infty \end{bmatrix}\]
\[\begin{matrix} A &B &C &D &E \end{matrix}\\\begin{matrix} A\\B \\C \\D \\E \end{matrix}\begin{bmatrix} \infty &4 &10 &14 &2 \\12 &\infty &6 &10 &4 \\16 &14 &\infty &8 &14 \\24 &8 &12 &\infty &10 \\2 &6 &4 &16 &\infty \end{bmatrix}\]
10 M
4 (b)
What is integer programming? Why its is ,needed and write is needed and write the branch and bound algorithm
10 M
5 (a)
The following tables gives the activities in a construction project and other related information.
i) Draw a pert network
ii) Calculate project duration
iii) Find the critical path
iv) Find the probability that the project will be completed within 50days.
| Activity | t0 | tm | tp |
| 1-2 | 20 | 30 | 46 |
| 1-3 | 9 | 12 | 21 |
| 2-3 | 3 | 5 | 7 |
| 2-4 | 2 | 3 | 4 |
| 3-4 | 1 | 2 | 3 |
| 4-5 | 12 | 18 | 24 |
i) Draw a pert network
ii) Calculate project duration
iii) Find the critical path
iv) Find the probability that the project will be completed within 50days.
14 M
5 (b)
Define the following
i) Normal time
ii) Crash time
iii) Free float
i) Normal time
ii) Crash time
iii) Free float
6 M
6 (a)
Define i) Fair game ii) Pure strategy iii) Mixed strategy
6 M
6 (b)
Use dominance to find the optimum strategies for the both player
\[\begin{matrix} B_{1} &B_{2} &B_{3} &B_{4} &B_{5} &B_{6} \end{matrix}\\\begin{matrix} A_{1}\\A_{2} \\A_{3} \\A_{4} \\A_{5} \end{matrix}\begin{bmatrix} 4 &2 &0 &2 &1 &1 \\4 &3 &1 &3 &2 &2 \\4 &3 &7 &-5 &1 &2 \\4 &3 &4 &-1 &2 &2 \\4 &3 &3 &-2 &2 &2 \end {bmatrix}\]
\[\begin{matrix} B_{1} &B_{2} &B_{3} &B_{4} &B_{5} &B_{6} \end{matrix}\\\begin{matrix} A_{1}\\A_{2} \\A_{3} \\A_{4} \\A_{5} \end{matrix}\begin{bmatrix} 4 &2 &0 &2 &1 &1 \\4 &3 &1 &3 &2 &2 \\4 &3 &7 &-5 &1 &2 \\4 &3 &4 &-1 &2 &2 \\4 &3 &3 &-2 &2 &2 \end {bmatrix}\]
7 M
6 (b)
Solve the game by graphical method
\[]\begin{bmatrix} 1 &-3 \\3 &5 \\-1 &6 \\4 &1 \end{bmatrix}\]
\[]\begin{bmatrix} 1 &-3 \\3 &5 \\-1 &6 \\4 &1 \end{bmatrix}\]
7 M
7 (a)
Write the characteristics of waiting lines
5 M
7 (b)
At what average rate must a clerk at super market work in order to ensure a probability of 0.9 that the customer will not have to wait longer than 12 minutes? It is assumed that there is
only one counter to which customer arrive in a Poisson fashion at an average rate of 15/hr. The length of service by the clerk has an exponential distribution
7 M
7 (c)
In a hair dress by saloon with one barber. the customer arrived follows Poisson distribution at an average rate of one every 45 minutes. The service time is exponentially distributed
with a mean of 30 minutes. Find:
i) Average number of customer in a saloon.
ii) Average waiting time of customer before service.
iii) Average idle time of barber
i) Average number of customer in a saloon.
ii) Average waiting time of customer before service.
iii) Average idle time of barber
8 M
8 (a)
Define the following:
i) Idle time ii) Total elapsed time
i) Idle time ii) Total elapsed time
4 M
8 (b)
Write the assumption underlying the sequencing problem
4 M
8 (c)
Find the sequence that minimizes the total elapsed time. idle time and normal time.
| Machine | Jobs | ||||
| A | B | C | D | E | |
| M1 | 6 | 8 | 7 | 10 | 6 |
| M2 | 3 | 2 | 5 | 6 | 4 |
| M3 | 4 | 8 | 6 | 7 | 8 |
12 M
More question papers from Operations Research