Four professors are capable of teaching any one of four different courses. Class preparation time in hours for different topics varies from professor to professor and is given in the table below:
| Professor | A | B | C | D |
|---|---|---|---|---|
| Linear Programming | 2 | 15 | 13 | 4 |
| Queuing Theory | 10 | 4 | 14 | 15 |
| Transportation Problem | 9 | 14 | 16 | 13 |
| Regression Analysis | 7 | 8 | 11 | 9 |
Each professor is assigned only one course. Determine an assignment schedule so as to minimise the total course preparation time for all courses.
___ ____ _________ ______ ___ _________ ________ ________ _________ _______.
______ _______ ____ _________ _____ ___ __________ _________ ________ ______ ___ ______.
_________ ________ ______ ___ __________.
_____ _____ _______ ______ __________ ________ _______ _____ ________ _________ _____ ________.
_________ ______ _______ _________ _______ __________ _____ ________ ________ _____ ___.
_______ ______ ______ _____ __________ ___.
__________ _______ ___ ____ _______ ________ _____ __________ ____ ___ ________ _______.
_______ _____ ____ _________ _________ ________ ________.
_____ ____ ___ ______ _____ ____ _________ ______ ___ ______.
__________ ______ ____ _____ _____ __________ _____ ____ __________ _____.
_________ ________ _________ _____ ___ __________ _______ ____ _______ ___.
_____ ______ ________ ___ ________ _______ _________.
__________ _________ _________ _________ ___ ________ ____ _________ __________ _________ _____ ________.
_____ __________ _______ ___ _______ __________ _________ ______ ________.
______ _______ ________ ___ ________ _______ __________.
__________ ____ __________ ________ ___ ____ __________ _________.
_____ ___ ___ ___ ____ _________ ___ ______ ______.
_________ ____ ________ _____ ________ __________ _____.
_________ __________ ___ _________ ________.
_______ ___ _______ ________ ______.
___ _______ ________ __________ ___ ______ _______.
___ _____ _____ _____ _____ _________.
_____ ______ _____ ___ _____ __________ ________ _______ __________ ___ ____ _____.
__________ ________ __________ ____ _______ ___ ________.
_____ __________ ________ _______ ___ ________.
___ ____ ____ _________ _______ ____ __________ _______ ________ _______.
_______ __________ ________ ________ __________ ______ _____ _______ ____ __________.
_____ __________ ________ ______ ________ __________ ____ ______ _________ _____ ___ ____.
____ _________ ______ ______ ___ _____ ____ ___.
_______ _________ ________ ___ ________ ____ ________ _____ _______ ___.
______ ____ _____ __________ _______.
____ ________ ___ ______ _____ _____ _____ ____ _______ _________.
_______ ______ ______ _______ ______ ______ ______ ________ _____ ___ __________ ______.
_____ _______ ________ ______ _______.
_______ ______ _________ ___ _______ ___ _______.
________ __________ ______ _____ __________.
__________ ________ ___ ______ _________ __________.
___ _________ _________ _______ _______ __________ ____.
_________ _________ ____ ___ ________ ____ ____ __________ ________ _______.
______ _______ ________ _________ ___ _______.
____ ______ ____ __________ ___ ___ ___.
_________ _________ ________ __________ ___.
___ ________ _______ _________ ___ ______.
____ ________ _____ ____ _____ _______ ______ ______ ____ _________ _____.
______ ________ ________ ___ _____ ______ _____ __________ _________ ____ _______.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
A company has three production facilities S1, S2 and S3 with production capacity of 7, 9 and 18 units (in 100s) per week of a product, respectively. These units are to be shipped to four warehouses D1, D2, D3 and D4 with requirement of 5, 6, 7 and 14 units (in 100s) per week, respectively. The transportation costs (in Rs) per unit between factories to warehouses are given in the table below:
| $D_1$ | $D_2$ | $D_3$ | $D_4$ | Capacity | |
|---|---|---|---|---|---|
| $S_1$ | 19 | 30 | 50 | 10 | 7 |
| $S_2$ | 70 | 30 | 40 | 60 | 9 |
| $S_3$ | 40 | 8 | 70 | 20 | 18 |
| Demand | 5 | 8 | 7 | 14 | 34 |
A firm wants to know whether there is any linear relationship between the sales (X) and its yearly revenue (Y). The records for 10 years were examined and the following results were obtained:$
(a) Fit a regression line taking Y as the dependent variable and X as the independent variable.
(b) Test whether the sales have any effect on revenue at 5% level of significance.
(c) Comment on the goodness of fit of the regression line.
In a railway marshalling yard, goods trains arrive at a rate of 36 trains per day. Assuming that the inter-arrival and service time distributions both follow exponential distribution with an average of 30 minutes, calculate the following:
(i) Traffic intensity
(ii) The mean queue length
(iii) Probability that the queue size exceeds
State whether the following statements are True or False. Give reasons in support of your answers.
(a) The solution of a transportation problem with 5 rows (supplies) and 4 columns (destinations) is feasible if number of possible allocations are 8.
(b) The moving averages of suitable period in a time-series are free from the influences of seasonal and cyclic variations.
(c) If the basic solutions for a system of equations are (- 2, 0, 1), (0, 1, 3), (- 2, 3, 0), then only (0, 1, 3) is feasible.
(d) In the stepwise selection method of multiple regression model, once a variable enters in the model then it always remains in the model.
(e) An enterprise requires 1000 units per month. The ordering cost is estimated to be 50 per order. The purchase price is 20 per unit and the carrying cost per unit is 10% of it. Then the economic lot size to be ordered is 775.
Using the graphical method to minimise the time required to process Job 1 and Job 2 on five machines A, B, C, D and E, find the minimum elapsed times an idle times to complete both jobs.
| Sequence | A | B | C | D | E | |
|---|---|---|---|---|---|---|
| Job 1 | Time (in hours) | 1 | 2 | 3 | 5 | 4 |
| Job 2 | Sequence | C | A | D | E | B |
| Time (in hours) | 3 | 4 | 2 | 1 | 5 |
Use the penalty (Big M) method to solve the following LP problem:
Minimise
Subject to the constraints.
Four professors are capable of teaching any one of four different courses. Class preparation time in hours for different topics varies from professor to professor and is given in the table below:
| Professor | A | B | C | D |
|---|---|---|---|---|
| Linear Programming | 2 | 15 | 13 | 4 |
| Queuing Theory | 10 | 4 | 14 | 15 |
| Transportation Problem | 9 | 14 | 16 | 13 |
| Regression Analysis | 7 | 8 | 11 | 9 |