Operation Research SPPU Endsem Question Paper May 2023
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 2023
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- VII
- Paper code
- [6004]-614
Printed for: B.E. (Mechanical Engineering)
Instructions to the candidates
- Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
- 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]
Write the generalised syntax of LPP and 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]
This part has equations that don’t show as text. Open the PDF to read it.
- b)[7]
Explain with the help of example generalized syntax and various terms involved in the LPP.
- 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 2024
- 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
Also asked:May 2024
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 2024
- a)
Q7
- 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 DP) Number of Marketing Zones salesman Zone I 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 2024
- b)[5]
OR- a)
Q8
- 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 shown 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 kilometres 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). 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]
Explain in brief various steps involved in the simulation.
- a)