Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Bachelors Level/Second Year/Fourth Semester/Science bit/fourth semester/operations research/syllabus wise questions

Bachelors In Information Technology

Institute of Science and Technology, TU

Operations Research (ORS255)

Year Asked: 2080.2, syllabus wise question

Decision Theory
1.
A milkman buys milk at Rs. 20 per litre and sells at Rs. 25 per litre. Unsold milk has to be thrown away. The daily demand has the following probability distribution, If each day’s demand is independent of previous day’s demand, using marginal analysis approach, how many litres should be ordered every day so as to maximize the profit? Also find (a) Max. EMV (b) EPPI (c) EPVI.

$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|c|c|}\hline \text{Demand (litres)} & 46 & 48 & 50 & 52 & 54 & 56 & 58 & 60 & 62 & 64 \\ \hline \text{Probability} & 0.01 & 0.03 & 0.06 & 0.10 & 0.20 & 0.25 & 0.15 & 0.10 & 0.05 & 0.05 \\ \hline \end{array}$
[10]
2.
Describe the scope of operations research in different fields. [5]
3.
Write short notes on: a) Marginal Analysis Approach in decision making. Write short notes on: b) Arithmetic Method in game theory. [2.5+2.5]
Networking Analysis
1.
The following activities must be completed in the order to complete the project. Determine critical path and time duration of the project.

$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|}\hline \text{Activity} & A & B & C & D & E & F & G & H & I & J \\ \hline \text{Predecessor} & - & - & A,B & B & A & C & E,F & D,F & G,H & I \\ \hline \text{Time (in week)} & 3 & 8 & 4 & 2 & 1 & 7 & 5 & 6 & 8 & 9 \\ \hline \end{array}$
[5]
Optimization(Linear Programming I: Formulation and Graphic Solution), (Linear Programming II: Simplex Method), Transportation problem, Assignment problem
1.
Determine the minimum transportation cost from the following matrix.

$\begin{array}{|c|c|c|c|c|c|}\hline \text{Warehouse/Store Cost per unit} & P_1 & P_2 & P_3 & P_4 & \text{Supply} \\ \hline W_1 & 45 & 60 & 45 & 30 & 70 \\ W_2 & 35 & 15 & 35 & 35 & 60 \\ W_3 & 30 & 25 & 45 & 55 & 90 \\ \hline \text{Demand} & 60 & 40 & 60 & 20 & \frac{220}{180} \\ \hline \end{array}$
[10]
2.
Solve the given linear programming problem (LPP) by using simplex method and interpret the findings.

$\text{Min Z =} 20A+10B$

$\text{Subject to}$

$A+2B \leq 40$

$4A+3B \geq 60$

$3A+B \geq 30$

$A,B \geq 0$
[10]
3.
There are three jobs P, Q and R to be completed on four machines A, B, C and D. The costs of performing the different jobs on machines are given below. Assign the jobs to different machines to minimize the total cost of performing the jobs on machines.

$\begin{array}{|c|c|c|c|c|}\hline \text{Jobs/Machines} & A & B & C & D \\ \hline P & 90 & 120 & 140 & 160 \\ Q & 40 & 65 & 85 & 95 \\ R & 50 & 75 & 95 & 110 \\ \hline \end{array}$
[5]
4.
Describe Hungarian Assignment Method (HAM) used for finding the optimal solution of assignment problem. [5]
5.
A food company at Kathmandu produce three types of a healthy food P, Q and R for children which contains three types of vitamin A, B, and C. Each unit of food P contains 2, 2 and 1 unit of vitamin A, B and C. One unit of food Q contains 2, 3 and 1 units while each unit of food R contains 1, 1 and 5 units of vitamin A, B and C respectively. Daily minimum requirements of vitamin A, B and C are 10, 12 and 14 units respectively. Formulate objective function and its constraints of LPP if cost per unit of food P, Q and R are Rs. 9, Rs. 12 and Rs. 15 respectively. [5]
Queuing Models
1.
A TV repairman finds that the time spent on his job has an exponential distribution with mean 30 minutes. If he repairs sets in the order in which they come and if the arrival of sets is approximately Poisson with an average rate of 10 per 8 hour day. What is his expected idle time each day? How many jobs are ahead of the set just brought in? [5]
2.
What is called a queue? Describe different queue disciplines. [5]
Theory of Games
1.
Assume that two firms are competing for market share for a particular product. Each firm is considering what promotional strategy to employ for the coming period. Assume that the following payoff matrix describes the increase in market share of Firm A and the decrease in market share for Firm B. Find the optimal strategy for each firm. Also determine value of the game.

$\begin{array}{|c|c|c|c|}\hline \text{FirmA/FirmB} & \text{No promotion} & \text{Moderate promotion} & \text{Much promotion} \\ \hline \text{No promotion} & 5 & 0 & -10 \\ \text{Moderate promotion} & 10 & 6 & 2 \\ \text{Much promotion} & 20 & 15 & 10 \\ \hline \end{array}$
[5]