64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn
64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn
64 m kj izns'k jktf"kZ V.Mu eqDr fo'ofo|ky;] bykgkckn
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
34<br />
93<br />
m <strong>kj</strong> izns’k jktf"<strong>kZ</strong> V.<strong>Mu</strong> <strong>eqDr</strong> fo’ofo|ky;] <strong>bykgkckn</strong><br />
vf/kU;kl (Assignment) 2012-2013<br />
Lukrd dyk dk;ZØe<br />
Under Graduate Art Programme<br />
fo’k; % xf.kr<br />
Subject : Mathematics<br />
dkslZ “kh’<strong>kZ</strong>d % Linear Programming<br />
Course Title : Linear Programming<br />
fo’k; dksM% ;w0th0,e0,e0<br />
Subject Code : UGMM<br />
dkslZ dksM % ;w0th0,e0,e0-12<br />
Course Code : UGMM-12<br />
vf/kdre vad % 30<br />
Maximum Marks:30<br />
Section - A<br />
[k.M & d<br />
vf/kdre vad % 18<br />
Max. Marks : 18<br />
uksV % nh<strong>kZ</strong> mRrjh; iz”uA vius iz”uksa ds mRrj 800 ls 1000 “kCnksa esa fy[ksaA lHkh iz”u vfuok;Z gSA<br />
Note : Long Answer Questions. Answer should be given in 800 to 1000 words.<br />
Answer all questions.<br />
1(a) Show that Dual of the dual of a primal L.P.P. is the primal L.P.P itself.<br />
fn[kkb;s fd izkbey ds }Sr dk }Sr Hkh ,d izkbey gksxkA 3<br />
(b) Show that the set of all feasible solutions of on L.P.P. is a convex set.<br />
fn[kkb;s fd L.P.P. ds fQftcy gky dk leqPp; ,d convex leqPp; gksxkA 3<br />
2(a) Obtain the dual of the following L.P.P. minimize Z = 2x2 + 5x3<br />
subject to L.P.P. dk }Sr Kkr djsaA 3<br />
x + x ³ 2<br />
(b)<br />
1<br />
2x<br />
x<br />
1<br />
2<br />
+ x<br />
- x<br />
2<br />
+ 6x<br />
+ 3x<br />
1 2 3<br />
1<br />
, x2<br />
, x3<br />
³<br />
3<br />
£ 6<br />
= 4<br />
and x 0<br />
Use simplex method to solve the following L.P.P. maximize<br />
Z = 4x1 + 10x2<br />
subject to constanits<br />
flEiysDl fof/k ls L.P.P. iz'u dks gy djsaA 3<br />
3(a)<br />
(b)<br />
2x<br />
1<br />
2x<br />
1<br />
2x<br />
+ x<br />
2<br />
+ 5x<br />
+ 3x<br />
1<br />
1<br />
, x2<br />
³<br />
£ 50<br />
2<br />
2<br />
£ 100<br />
= 90<br />
and x 0<br />
Solve the following linear programming problem graphically:<br />
L.P.P. iz'u dks fp= fof/k ls gy djsaA 3<br />
Z = x 1<br />
+ x subject to constanits<br />
Maximize<br />
2<br />
x + x £ 1<br />
1<br />
- 3x<br />
2<br />
+ x<br />
1 2<br />
1<br />
³ 0,<br />
x 2<br />
³<br />
³ 3<br />
and x 0<br />
Define saddle point for the person two choice zero sum game. Is it necessary<br />
that two person two choice zero sum game always posses a saddle point.<br />
lSMy fcUnw dks ifjHkkf"kr djsa nks O;fDr;ksa ds 'kwU; ;ksx [ksy ds fy, D;k nks O;fDr;ksa ds 'kwU;<br />
[ksy esa lSMy fcUnq vo'; :i ls gksrk gSA 3<br />
Section - B<br />
[k.M & [k<br />
vf/kdre vad % 12<br />
Max. Marks: 12<br />
uksV % ykq mRrjh; iz”uA vius iz”uksa ds mRrj 200 ls 300 “kCnksa esa fy[ksaA lHkh iz”u vfuok;Z gSA<br />
Note : Short Answer Questions. Answer should be given in 200 to 300 words.<br />
Answer<br />
all questions.<br />
4 Solve the following transportation problem: 3<br />
VªkUliksVs'ku iz'u dks gy djsaA<br />
W 1 W 2 W 3 Supply<br />
F1 3 6 5 5<br />
F2 3 4 1 7<br />
F3 6 6 8 8<br />
F4 2 8 4 20<br />
Demand 8 10 22 40<br />
5 Solve the following assignment problem: 3<br />
,lkUesUV iz'u dks gy djsaA<br />
Man