MA/MSCMT-10/7 MA/MSCMT-10 December — Examination 2021 M.A./M.Sc. (Final) Examination MATHEMATICS (Mathematical Programming) Paper : MA/MSCMT-10 Time : 1% Hours | 1 [ Masimium Marks + 80 Note =~ The question paper is divided into wo Sections A and B. Write answers as per the given instructions. Use of non-programmable Scientific Calculator is allowed in this paper. Section-A, axd=16 (ery Short Answer Type Questions) Note Answer any four questions. As per the nature of the question delimit your answer in one word, one sentence or maximum up to 30 words. Each ‘question carries 4 marks. a 405 tun over L@ ai) Gi) wy) “ ‘A. hyperplane is given by the equation Sn + 2 + dry + Tay = 8. Find in which half spaces do the point (1,2, 4, 1 is Define positive semi-definite and negative semi-definite quadratic forms Write standard form -I for revised simplex method of linear programming problem Max. Subject to AX = x20 Explain importance of integer programming problem. Write steps of fractional cut method for solving integer programming problem. MA/MSCMT-10 /7 @) 405(vi) Test the definiteness of the quadratic form 30 Ol) XTAX=(4,19,45)]0 2 0|/ x2 0 0 Ils] (vi) Define constrained optimization problem and unconstrained optimization problem. (iil) Write dual of quadratic forms when X is unrestricted in sign, Max FO) Subject to £2) = by 122, en Section-B (Short Answer Type Questions) ‘Note Answer any four questions. Each answer should not ‘exceed 200 words. Each question carries 16 marks. MA/MSCMT-10/7 en) 405 tun over Solve the following linear programming problem tsing cevised simplex method ill first revised simplex table Max. Z= 3, + 6m, + 2s Subject 10 Bx, + ey + ay 43x +2y21 sy xp my 20 Use Branch and Bound Method to solve the following integer programming problem where x, and x are integers Max. Z = dx, + 3x, MA/MSCMT-10 /7 «ay 405Subject to 56 sy m2 0 4, Find the dimension of a rectangular parallelopiped with largest volume whose sides are parallel to the coordinate planets, to be inscribed in the elipsoid 5, Use Kuhn-Tucker conditions to solve the following nonlinear programming problem Max Foxy) = Taf ~ 6014503 ‘Subject to +2510 = ay <9 120 MA/MSCMT-10/7 cs 405 tun over MA/MSCMT-10/7 Solve the following quadratic programming problem by Beale's method Min Fos) “1089 449 +4 9910 259 Subject 10 y+ 2m <10 atnsd 20 Prove that every local maximum of the general convex programming problem is its global Use dynamics programming to solve Min, ap tx} +t, Subject 10 and. 4059. Solving the following linear programming problem by using dynamic programming Max. 3x, +55 Subject to and MA/MSCMT-10/7 on) 405