Firstranker's choice
Roll No.
--- Content provided by FirstRanker.com ---
B.Tech.(CSE/IT) (?.?. 2011 Onwards)
OPERATION RESEARCH
Subject Code : IT-310
(Sem.-6)
Time: 3 Hrs.
--- Content provided by FirstRanker.com ---
Max. Marks : 60
Total No. of Questions : 18
Total No. of Pages : 02
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
- SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.
--- Content provided by FirstRanker.com ---
SECTION-A
Explain the following :
- Discuss the advantages of O.R.
- What is objective function?
- Define Convex Set.
- Surplus variable.
- Find the feasible solution of following transportation problem using North-West corner method.
--- Content provided by FirstRanker.com ---
| W1 | W2 | W3 | W4 | Supplies | |
|---|---|---|---|---|---|
| F1 | 14 | 25 | 45 | 5 | 6 |
| F2 | 65 | 25 | 35 | 55 | 8 |
| F3 | 35 | 3 | 5 | 15 | 6 |
| Requirement | 4 | 7 | 16 | 13 |
- Define Cell Evaluation.
- Solve the game :
--- Content provided by FirstRanker.com ---
| I | II | III | |
|---|---|---|---|
| I | -2 | 15 | -2 |
| II | -5 | -6 | -4 |
| III | -5 | 20 | -8 |
- Waiting line problem.
- Queue Discipline.
- Simulation
SECTION-B
--- Content provided by FirstRanker.com ---
- Discuss significance and scope of OR in Business and industry.
- How Simplex method of solving a linear programming problem is better than graphic method?
- Explain Hungarian Assignment Method.
- Solve the following problem by NWCM.
| W1 | W2 | W3 | W4 | Capacity | |
|---|---|---|---|---|---|
| F1 | 19 | 30 | 50 | 10 | 7 |
| F2 | 70 | 30 | 40 | 60 | 9 |
| F3 | 40 | 8 | 20 | 18 | 14 |
| Requirement | 5 | 8 | 7 | 15 |
- Discuss various stages of decision making theory.
--- Content provided by FirstRanker.com ---
SECTION-C
- What is LPP? What are the assumption in formulating linear programming problem?
- Given the following data, determine the least cost allocation of available machines to four jobs.
| A | B | C | D | |
|---|---|---|---|---|
| 25 | 29 | 31 | 42 | |
| 22 | 19 | 35 | 18 | |
| 39 | 38 | 26 | 20 | |
| 34 | 27 | 28 | 40 |
- Explain the methods for solving a goal programming problem.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B.Tech 6th Semester Last 10 Years 2009-2019 Previous Question Papers|| Punjab Technical University
--- Content provided by FirstRanker.com ---