Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results.
Minimize Z = 2A + 10B
Subject to constraints:
A + B = 50
A ≥ 20
B ≤ 40
Where, A, B ≥ 0
Find transport schedule to minimize the transportation cost for the following transportation problem. The transportation cost per unit and units demanded and available are given in the table.
| From | To | A | B | C | Units demanded |
| X | 9 | 10 | 10 | 5 | |
| Y | 10 | 14 | 8 | 20 | |
| Z | 13 | 10 | 8 | 20 | |
| Units available | 20 | 15 | 10 | 45 |
The table give below give the information about the activities, their predecessors and time duration required to complete the activities of the project.
| Activity | A | B | C | D | E | F | G | H |
| Predecessor | - | - | A | B | A,D | B | C,E,F | G |
| Time in weeks | 5 | 12 | 6 | 3 | 2 | 6 | 14 | 22 |
Draw the network diagram and identify the critical activities and critical path. Also find the minimum time duration required to complete the project.
Attempt any Eight questions
[8x5=40]Callennoids Metropolitan is putting up bids for four used motorbikes company. The Metropolitan allows individuals to make bids on all four motorbikes company but will accept only one bid per individual have made the following bids (in thousands Rs).
| Motorbike Company | ||||
| Individuals | Honda | Hero | Bajaj | Yamaha |
| A | 100 | 90 | 110 | 90 |
| B | 110 | 100 | 95 | 95 |
| C | 105 | 95 | 90 | 105 |
| D | 115 | 100 | 95 | 100 |
Make the use of Hungarain method to assign the individuals to different motorbike company in order to maximize the revenue.
A milk salesman estimates the probability of the demand for a litre of milk is as follows:
| Demand | 11 | 12 | 13 | 14 | 15 |
| Probability | 0.10 | 0.15 | 0.30 | 0.25 | 0.20 |
He purchase a litre of milk @ of Rs. 60 and sells it @ of Rs. 70. Prepare payoff table and find the optimal act based on using EMV and EOL criterion determining the unsold milk has value.
On the average 96 patients per 24 hours day require the emergency service in clinic. Also on the average, a patient requires 10 minutes of active attention. Assume that the facility can handle only one emergency at a time. If this situation satisfy the all the conditions for apply queuing theory, find the average (expected) queue length and the waiting time for the patient to be served.
Determine the best strategy for each player A and B and value of the game.
| Player A's strategy: | Player B's strategy: | |||
| B₁ | B₂ | B₃ | B₄ | |
| A₁ | 40 | 40 | 40 | 40 |
| A₂ | 30 | 30 | 20 | 50 |
| A₃ | 10 | 30 | 90 | 20 |
The following tables gives the three kinds of foods and three kinds of vitamin contained on them. Formulate objective function and constraint of LPP for minimizing the cost.
| Vitamin | Food | Daily Requirements | ||
| F₁ | F₂ | F₃ | ||
| V₁ | 20 | 10 | 10 | 300 |
| V₂ | 10 | 10 | 10 | 200 |
| V₃ | 10 | 20 | 10 | 240 |
| Cost per unit of food | Rs. 20 | Rs. 24 | Rs. 18 | |
Describe modified distribution (MODI) method used for testing the optimality of initial solution of transport problem.
What is called a queue? Describe the operating characteristics of the single channel queuing model.
The following activities must be completed in order to complete the project. Draw network diagram and establish relationship between the activities of the project.
| Activity | P | Q | R | S | T | U | V | W | X |
| Predecessor | - | - | P, Q | Q | P | R | T, U | S, U | V, W |
Write short note on:
a. Scopes of operations research
b. Dominance Rule Method in game theory