Operation Research SPPU Endsem Question Paper May 2024
All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.
- Subject code
- 402045D
- Pattern
- 2019 pattern
- Exam
- Endsem
- Session
- May 2024
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- VII
- Paper code
- [6263]-221
Printed for: B.E. (Mechanical)
Instructions to the candidates
- Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 ro Q.6 Q.7 ro Q.8.
- Answers in one answer books.
- Figures to the right indicate full marks.
- Assume suitable data, if necessary.
Questions
Q1
- a)[10]
This part has equations that don’t show as text. Open the PDF to read it.
- b)[7]
Discuss the following terms related to LPP. i) Objective function ii) Constraint surface iii) Feasible and infeasible points iv) Optimum solution
OR- a)
Q2
- a)[10]
One kind of cake requires 200g of flour and 25g of fat, and another kind of cake requires 100g of flour and 50g of fat. Find the maximum number of cakes that can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients, used in making the cakes. Formulate LPP and Use Graphical method to solve.
- b)[7]
Explain the limitation of LPP in solving Engineering problem. How this is used for the optimization. 2
- a)
Q3
- a)[8]
Discuss the following related to the transportation model. i) Feasible solution ii) Optimum solution iii) Non-degenerate basic feasible solution iv) Degenerate basic feasible solution
Also asked:May 2023
- b)[10]
This part has equations that don’t show as text. Open the PDF to read it.
OR- a)
Q4
Q5
- a)[12]
This part has equations that don’t show as text. Open the PDF to read it.
- b)[6]
Explain in brief following (Any 3) : i) Gradual failure ii) Sudden failure iii) Progressive failure iv) Retrogressive failure v) Random failure 4
Also asked:May 2023
OR- a)
Q6
- a)[10]
This part has equations that don’t show as text. Open the PDF to read it.
- b)[8]
Differentiate between CPM and PERT and also discuss various floats involved in the in CPM analysis of network.
Also asked:May 2023
- a)
Q7
- a)[12]
A salesman located in a city A decided to travel to city B. He knew the distances of alternative routes from city A to city B. He then drew a highway network map as show in following figure. The city of origin A, is city 1. The destination city B is city 10. Other cities through which the salesman will have to pass through are numbered 2 to 9. The arrow representing routes between cities and distances in kilometers are located on each route. The salesman problem is to find the shortest route that covers all the selected cities from A to B. The time for each activity is given in the table. (Solve by using Dynamic programming). 5 Activity Duration Activity Duration 1-2 4 4-5 6 1-3 6 4-6 10 1-4 3 4-7 5 2-5 7 5-8 4 2-6 10 5-9 8 2-7 5 6-8 3 3-5 3 6-9 7 3-6 8 7-8 8 3-7 4 7-9 4 8-10 7 9-10 9
- b)[5]
- a)
Q8
- a)[12]
A company has five salesmen who have to be allocated to four marketing zones. The return (profit) from each zone depends upon the numbers of salesman working in that zone. The expected return for different numbers of salesman in different zones, as estimated from the past record, are given in the following table. Determine the optimum allocation policy. (Use Dynamic Programming). Number of Marketing Zones Salesmen Zone 1 Zone 2 Zone 3 0 30 35 42 1 45 45 54 2 60 52 60 3 70 64 70 4 79 72 82 5 90 82 95 6 98 93 102 7 105 98 110 8 100 100 110 9 90 100 110
Also asked:May 2023
- b)[5]
Explain in brief methodology involved in the simulation.
- a)