[This question paper contains 6 printed pages.] St. Noy of Question Paper : Unique Paper Code Name of the Paper Name of the Course Semester Durat iow : 3 Hours Your RoJl Nowe A 1114 32351601 : BMATH 613 - Complex Analysis B.Sc. (1) Mathematics vi Maximum Marks : 75 Instru¢tions for Candidates Mrite your Roll No. on the top immediately on receipt1114 . we2r4 + snow that li, sim = 2V5t A; (3+3=6) oe u and Vv denote the real and imagini components of the function f defined p aginary the equations Y means of 2 peaye {2/2 when z#0 when z=0 Verify that the Cauchy-Riemann equatio a satisfied at the origin z = (0,0) ang a “ 6) (oxy = Fand jimg(2) =, prove that (6) (3.3+3=6.5), ne = 2aez = 2nr + icosh™'2 s them in the form 2 = 2net (3.5+3=6.5) (3.543°6.5)14 3 (iiylog(—1 + VBi) = In2 +2(n +3) mi (n= 0, 41,42) one that &xpiz) = exp (i2) if and only if zane (n= 0,1, £2,,..). (6.5) 3 (a), (i) Ste mean value theorem of integrals. Does it hold true for complex valued functions? Justify. (ii) Evaluate fo" e™%esin ag. (3+3=6) (b) Parametrize the curves C, and C,, where i -ltol ° vertices -1,-1+i, (3436)1114 co -ke an fF (i) fp; dz depend only on the end points of C. (3+3=6) (d) State ML inequality theorem. Use it to prove that lfe S| <4v2, where C denotes the line segment from z = i to z= 1, ‘| (244=6) 4. (a) A function f(z) is continuous.on a domain D such that all the integrals of f(z) around closed contours lying entirely in D have the value zero. Prove that f(z) has an antiderivative throughout D (6.5) : it theorem. Use it to evaluate is the unit circle he circle |z| = 2Ta 5 (d) (i) State Liouville’s theorem: Is the function f(z) = cos z bounded? Justify. (ii) Is it true that ‘If p(z) is 4 polynomial in 2 er be- then the function f(2)= 1/p(2) can nev an entire function’? Justify (4.5+2=6.5) 5. + (a) Ifa series Di-1 Zn of complex numbers converges 0, Is thé convers¢ true? then prove lim z, = es (6.5) Justify. (h) Find the integral of f, SS where C is the circle |2| = 2. (6.5) is positively oriented entation for the 2, = 2. Hence6 ui4 : prove that it i# the Tylor series for the 5 Unetion f(z) in power of = 4%. (6.8) iven function f(z) = 241 6. Comes F(@) = find the poles: ’ order of poles and their Corresponding resid We. (6) (b) Write the two Laurent Series in Powers of z that represeht the function f(2)=—— in certain ze domains and specify those domains. 6) (©) Suppose that 2, = x, + iy,, (n = 1,23...) and ‘Ss s hen prove that n = X andDiar Yn = Y. (6) lity for a function f(z). Wa ic everywhere in the’ finite mber of singular points jented simple closed * (6)(This ques Sr. No.’ of Question Paper ; Unique Paper Code Name of the Paper Of the Course 4 are Scemwste Duration «3 Hours a ion paper contains § printed pages.) Your Roll NO....seeeeee0 1299 32357616 - DSE-4 Linear Programming and Applications CBCS (LOCF) - B.8e. (11) Mathematics VI Maximum Marks ; 75 P immediately on receipt hquestion, = -1299 Minimize Bx + 2y subjectto Sx + y 210 et+ye6 x+4y2 12 x20y20, (b) Define a Convex Set. Show that the set $'defined ea . as: $= (xy) [xX +9? S 4} is a ConvexSei -(e) Find all basic feasible solutions of the equations: x, + x, + 2x, + 3x, = 12 'y basic feasible solution of the zy Problem: G77 CX Ax =b, x20 xtreme point of the feasible1299 3 9 (ay Lee us consider the following Linear Programming Problem 2 ad Mininiize 4 = ex ze subject tor Ax = b, x2 0 Let (X40) be a basic feasible solution corresponding to a basis B having an a, with »* © +0 and all corresponding enteries yy S 0, i then show that Linear Programming Problem has an unbounded solution. (b) Lyt x, =-2, x2 > 1, x3 = 1 be a feasible solution to ~ the system of equations: fax, - x, = 5 ax.= 18°. solution? If not, reduce it feasible solutions. " . , find the solution of the1299 4 (d) Solve thé following Linear Programming Rroblent by Big-m Method: Maximize X1 = 4x2 + Oxy i subject to 2x, = Xa $5x5 = 40° x 2 ~ 3Xq 2 22 1 +X + 2xy = 30 X1)X,X3 20, 3. (a) Solve the following Linear Programming Problem by Two Phase Method : Maximize x1 + 4x, + 3x3. subject to A tHy +x 24 ‘ o2xy + 3x2 = 43 $21299 an m Maximize 2x; + x2 subject to xy — x2 $10 2x, - x, 5 40 120, x, 20. ‘ 7 i nt (d) Find the optimal solution of the Assignme Problem with the following cost matrix :1299 6 (b) State and prove Sma QVeak Duality ‘iearene Also show that if the objective function values corresponding to feasible solutions of the Primal and Dual Problem are equal then the-Fgspiective solutions are optimal lor the respective mipbliie (c) Using Complementary Slackness Theorein, find optimal solutions of the following. Linear Programming Problem and its Dual: + i Maximize 4%, + 3x2 subject to x, +2x,S2 x, - 2x, $3 dx, + 3x, 55 i x, +4252 i 3x, +x, 53 X22 0. Asporuition + (d) For the following vost minimization 1 i¢ Heasible solutions by using I Cost Meshod and WJ. Compare the1299 | 7 S. (ay Sdlve the following cost minimization Pransporlation Problem (b) Pour new machines are to be installed in a machine shop and there are fiye vaéant places available. ‘ Each machine can be installed at to one and only one pla : | ic gost of Balaton gl each job on