university, bhopal assignment question paper - Madhya Pradesh ...
university, bhopal assignment question paper - Madhya Pradesh ...
university, bhopal assignment question paper - Madhya Pradesh ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
M P BHOJ (OPEN) UNIVERSITY, BHOPAL<br />
ASSIGNMENT QUESTION PAPER<br />
2009-10<br />
CLASS : M.Sc. Final SUBJECT: Mathematics<br />
Paper - III - Operation Research<br />
funsZ'k %&<br />
1- lHkh iz'u Lo;a dh gLrfyfi esa gy djuk vfuok;Z gSA 2- nksuksa l=h; iz'ui= gy djuk vfuok;Z gsa<br />
3- l=h; dk;Z mÙkjiqfLrdk ds vafre i`"B ij lacaf/kr fo"k; dh laiUu<br />
laidZ d{kkvksa dh frfFk;ksa ,oa ijke'kZnkrk ds uke ,oa in dk<br />
vo'; mYys[k djsaA<br />
5- l=h; dk;Z mÙkjiqfLrdk,a tek djus dh vafre frfFk 20<br />
vizsy 2010 gSA<br />
4- vafre frfFk mijkar l=h; dk;Z mÙkjiqfLrdkvksa dks ekU; ugha djrs<br />
gq, ewY;kafdr ugha dh tkosxhA<br />
6- l=h; dk;Z mÙkjiqfLrdk,a tek djus dh jlhn vo'; izkIr dj ysaA<br />
7- nks l=h; dk;Z izkIrkadksa esa ls fdlh ,d esa vf/kdre vad dh iwoZ izpfyr O;oLFkk ds LFkku ij nksuksa l=h; dk;ksZa ds izkIrkadksa<br />
ds vkSlr vad l=kar ijh{kk ifj.kke esa tksM+s tk,axsA lHkh iz'uksa ds vad leku gSaA<br />
First Assignment Max Marks - 30<br />
Q.1. A Company produces two kinds of leather belts A and B . A is of superior quality and B is of<br />
lower quality. The respective profits are Rs. 10 and Rs. 5 per belt. The supply of raw material is<br />
sufficient for making 850 belts per day. For belt A special type of buckle is required and 500 are<br />
available per day. There are 700 buckles available for belt B per day. Belt A needs twice as much<br />
time as that required for belt b. & company can produce 500 belts of all of them were of type A.<br />
Formulate LPP & solve it graphically.<br />
Q2. Solve following transportation problem & test the optimality by MODI method.<br />
F1 F2 F3 F4 SUPPLY<br />
W1 21 16 25 13 8<br />
W2 17 18 14 23 10<br />
W3 32 27 18 41 12<br />
DEMAND 20 15 15 30 20<br />
Q3. Use Branch & Bound technique to find an solution<br />
Max. Z = x 1 + 4 x2<br />
Sub. to 2x1 + 4x2 ≤ 7<br />
5x1 + 3x2 ≤ 15, x1 , x2 ≥ 0.<br />
Q4. Solve the following pay-off matrix , determine the optimal strategies and value of game<br />
A = 5 1<br />
3 4<br />
Q5. Solve the following by Simplex method to<br />
Minimize z = x1 – 3x2 + 2x3<br />
Sub. to 3x1 – x2 + 3x3 ≤ 7<br />
-2x1 + 4x2 ≤ 12 & x1, x2 ≥ 0<br />
Second Assignment Max Marks – 30<br />
P.T.O.