1 (a)
The following are the two constraints for the LPP under consideration.
x_{1}x_{2}≥1; x_{1}+x_{2}≥7; and x_{1}, x_{2}≥0
using the graphical method, answer the following questions:
i) What are the extreme points for the feasible region?
ii) If the problem has an objective function maximize z=3x_{1}+x_{2}, what is the optimal point?
iii) If the problem has an objective function, minimize z=3x_{1}+x_{2}, what is the optimal point.
x_{1}x_{2}≥1; x_{1}+x_{2}≥7; and x_{1}, x_{2}≥0
using the graphical method, answer the following questions:
i) What are the extreme points for the feasible region?
ii) If the problem has an objective function maximize z=3x_{1}+x_{2}, what is the optimal point?
iii) If the problem has an objective function, minimize z=3x_{1}+x_{2}, what is the optimal point.
10 M
1 (b)
Solve the following problem using graphical method maximize Z=2x_{1}+3x_{2} Subject to constraints: 2x_{1}+z_{2}≤6; x_{1}x_{2}≥3; x_{1}, x_{2} ≥0.
6 M
1 (c)
List any four characteristics of a good model.
4 M
2 (a)
Solve the following LPP by BigMethod.
Maximize
X= 30000x_{1} + 20000x_{2}
Subject to:
x_{2}≤x_{1}+3; x_{2}≤6; x_{2}≥2; x_{1}+2x_{2}≤18; 2x_{1}+x_{2}≤24 and x_{1}, x_{2} ≥ 0.
Maximize
X= 30000x_{1} + 20000x_{2}
Subject to:
x_{2}≤x_{1}+3; x_{2}≤6; x_{2}≥2; x_{1}+2x_{2}≤18; 2x_{1}+x_{2}≤24 and x_{1}, x_{2} ≥ 0.
14 M
2 (b)
Write the dual for the following primal.
Minimize Z=25000x_{1}+35000x_{2}
Subject to:
50x_{1}+60x_{2}=2500; 80x_{1}+60x_{2}≥3000; 100x_{1}+200x_{2}≥7000
Nonnegativity constraints: x_{1}, x_{2}≥0.
Minimize Z=25000x_{1}+35000x_{2}
Subject to:
50x_{1}+60x_{2}=2500; 80x_{1}+60x_{2}≥3000; 100x_{1}+200x_{2}≥7000
Nonnegativity constraints: x_{1}, x_{2}≥0.
6 M
3 (a)
A product is produced by four factories A, B, C & D. The unit production costs in them are ₹2, ₹3, ₹1 and ₹5 respectively. Their production capacities are: Factory A: 50 units; B: 70 units; C=30 units and D: 50 units. These factories supply the product to four stores, the demand of which are 25, 35, 105 and 20 units respectively. Unit transportation cost in rupees from each factory to each store is given in the table below:
Determine the extent of deliveries from of the factories to each of the stores so that the total production transportation cost is minimum.
1 2 3 4
Determine the extent of deliveries from of the factories to each of the stores so that the total production transportation cost is minimum.
1 2 3 4
Stores  
Factories 

12 M
3 (b)
Four machines M_{1}, M_{2}, M_{3} and M_{4} are to be installed in a machine shop. There are five vacant places A, B, C, D and E. Owing to the limitations machine M_{2} cannot be placed at C and M_{3} cannot be placed at A. The assignment cost of machine i to place j in rupees (1000) is shown below.
Find the optimal assignment schedule.
Find the optimal assignment schedule.
A  B  C  D  E  
M_{1}  4  6  10  5  6 
M_{2}  7  4    5  4 
M_{3}    6  9  6  2 
M_{4}  9  3  7  2  3 
8 M
4
Solve the below given integer programming problem:
Maximize
Z=4x_{1}+6x_{2}+2x_{3}
Subject to
4x_{1}4x_{2}≤5
x_{1}+6x_{2}≤5
x_{1}+x_{2}+x_{3}≤5
x_{1}, x_{2}, x_{3}≥0 and x_{1}, x_{3} are integers.
Maximize
Z=4x_{1}+6x_{2}+2x_{3}
Subject to
4x_{1}4x_{2}≤5
x_{1}+6x_{2}≤5
x_{1}+x_{2}+x_{3}≤5
x_{1}, x_{2}, x_{3}≥0 and x_{1}, x_{3} are integers.
20 M
5
Following data refer to a project:
a) Draw the network diagram
b) Find out the ES, EF, LS, LF and slack for each activity.
c) Find out variance standard deviation for the critical path.
d) Determine the probability of completing the project in 24 hrs.
a) Draw the network diagram
b) Find out the ES, EF, LS, LF and slack for each activity.
c) Find out variance standard deviation for the critical path.
d) Determine the probability of completing the project in 24 hrs.
Activity  Immediate Predecessor  Optimistic Time (Hrs)  Most likely Time (Hrs)  Pessimistic Time (Hrs) 
A B C D 
  A A 
4 1 3 4 
6 4.5 3 5 
8 5 3 6 
E F G H 
A B, C B, C E, F 
0.5 3 1 5 
1 4 1.5 6 
1.5 5 5 7 
I J K 
E, F D, H G, I 
2 2.5 3 
5 2.75 5 
8 4.5 7 
20 M
6 (a)
Mention and discuss seven elements of queuing system.
7 M
6 (b)
Define: (i) Balking (ii) Renegging (iii) Jockeying.
3 M
6 (c)
On an average 96 patient per 24hours day require the service of an emergency clinic. On an average a patient requires 10 minutes of active attention. The facility can handle only one emergency at a time. Suppose that it costs the clinic ₹100 per patient treated to obtain an averaging service time of 10 minutes and that each minute and that each minute of decrease in this average time would cost the clinic ₹10 per patient treated. How much would have to be budgeted by the clinic to decrease the average queue size from \( 1\dfrac {1}{3} \) patients as to \( \dfrac {1}{2} \) patient?
10 M
7 (a)
What are the characteristics of games?
4 M
7 (b)
Solve the following game by the dominance rule.
Can we formulate the above game as LPP and solve it by simplex/BigM method? If yes discuss how?
Can we formulate the above game as LPP and solve it by simplex/BigM method? If yes discuss how?
B's Strategy  
A's Strategy 

8 M
7 (c)
Solve the following game using graphical approach:
A's Strategy  B's Strategy  


b_{1}  b_{2}  b_{3}  b_{4}  


a1  8  5  7  9  
a2  6  6  4  2  

8 M
8 (a)
You are given the following data regarding the processing times of some job on three machines I, II and III. The order of processing is IIIIII. Determine the sequence that minimizes the total elapsed time required to complete all the jobs. Mention clearly the total elapsed time and the idle time of machine II and III.
Job  Machine  
I  II  III  
A  3  4  6 
B  8  3  7 
C  7  2  5 
D  4  5  11 
E  9  1  5 
F  8  4  6 
G  7  3  12 
10 M
8 (b)
Madan Mathur is the supervisor of legalcopyexpress, which provides copy services for downtown Los Angeles law firms. Five customers submitted their orders at the beginning of the week and are as follows. Schedule the jobs as per i) EDD rule ii) SPT rule and iii) Slacktime remaining per operation rule. Which rule gives the best result in terms of mean flowtime?
Job (In order of arrival)  A  B  C  D  E 
Processing Time (Days)  3  4  6  2  1 
Due date (Days hence)  5  6  7  9  2 
10 M
More question papers from Operations Research