Paper: QUANTITATIVE TECHNIQUE (1A) Specific Instructions: Answer all the four questions. Marks allotted 100.

General Instructions:

The Student should submit this assignment in the handwritten form (not in the typed format) The Student should submit this assignment within the time spe ified by the e!am dept "a h #uestion mentioned in this assignment should be answered within the word limit spe ified The student should only use the $ule sheet papers for answering the questions. The student should atta h this assignment paper with the answered papers. %ailure to omply with the abo&e %i&e instru tions would lead to re'e tion of assignment.

Question No - 1 a. (hat is solution) (hat is basi solution) (hat is basi feasible solution) *ow many basi solutions are possible for the equation +!,-y,./ 0 10. %ind one basi solution. 2s the solution feasible)

b. A retired person wants to in&est up to an amount of $s +13000 in fi!ed in ome se urities. *is broker re ommends in&esting in two bonds4 bond A yielding 56 and bond 7 yielding 106. After some onsideration3 he de ides to in&est at most $s 1+3000 in bond 7 and at least $s 83000 in bond A. *e also wants the amount in&ested in bond A to be at least equal to the amount in&ested in bond 7. what should the broker re ommend if the in&estor wants to ma!imi/e his return on in&estment. %ormulate the 9: problem and sol&e it graphi ally. . (hat is a redundant onstraint) (hat does it imply) ;oes it affe t the optimal solution to an 9::)

d. ;efine iso<profit line. *ow does it help to obtain solution to the 9::)

Question No 2 a. $ewrite the following 9:: in standardi/ed form for appli ation of simple! method and sol&e it = Ma!imi/e Sub'e t to 1!1 , ?!+ , 8!? , !1 @ 10 A!1 = -!+ , 5!? = !1 B 80 8!+ , +!? , 1!1 0 15 !13 !+3 !?3 !1 B 0 > 0 .!1 , 8!+ , 5!? , +!1

b. Sol&e the following 9:: =

Ma!imi/e > 0 ?!1 , +!+ , ?!? Sub'e t to +!1 , !+ , !? @ + ?!1 , 1!+ , +!? B. C13 !+3 !? B 0 2s there any alternate optimal solution to this problem) Di&e reasons

Question No 3 a. (hat is the signifi an e of the duality theory of linear programming) ;es ribe the general rules for writing the dual of a 9::. b. :ro&e with an e!ample that dual of the dual is primal. . Eonstru t the dual of the following problemF Ma!imi/e > 0 5!1, -!+ = +!? Sub'e t to !1 , !+ , ?!? 0 10

+!1 = !+ , ?!? @18 ?!1 , !+ = +!? B 0 !13 !+ B 0 3 !? unrestri ted d. ;efine with e!ample4 unbounded solution and infeasible solution.

Question N0 4 a. A ompany produ es two produ ts A and 7. ea h unit of produ t A requires 1 hour of engineering ser&i e and - hours of ma hine time. To produ e 1 unit of produ t 7 requires + hours of engineering and . hours of ma hine time. There are 100 hours of engineering and 100 hours of ma hine time a&ailable. The ost of produ tion is a nonlinear fun tion of the quality produ ed as gi&en in the following table4 :rodu t A :rodu tion Gnit Eost (Gnits) ($s) 0<-0 10 -1<100 . :rodu t 7 :rodu tion Gnit Eost (Gnits) ($s) 0<10 5 11<100 ?

The unit selling pri e of produ t A is $s 1+ and the unit selling pri e of produ t 7 is $s 11. The ompany would like a produ tion plan whi h gi&es the number of units of A and the number of units of 7 to be produ ed that will ma!imi/e profit. %ormulate an integer programming model for this problem.

b. The owner of a ready<made garments store sells two types of premium shirts3 known as >ee<shirts and Star<shirts. *e makes a profit of $s +00 and $s ?00 per shirt on >ee and Star shirts3 respe ti&ely. *e has two tailors3 A and 73 at his disposal to stit h the shirts. Tailor A an de&ote a total of 15 hours per day3 while tailor 7 an gi&e at the most 1- hours a day. 7oth types of shirts are stit hed by both the tailors. The time needed for stit hing a >ee shirt is + hours by tailor A and ? hours by tailor 7. similarly3 a Star shirt requires 1 hours by tailor A and ? hours by tailor 7. *ow many shirts of ea h type should be stit hed in order to ma!imi/e daily profit) %ormulate it as an integer programming problem and sol&e it by utting plane algorithm.