PU-Question Bank Linear Programming 8 Multiple Choice Questions 1. The comer points of the feasible segion determined by the following system of linear incqualities De ty S10.x43y515, 1,720 ase (0,0).(8.0).(3.4) and (0.8). Let Z~pe+qy, where p.9>0. Condition on p and «0 thatthe maximam of Z occurs at both (3,4) and (0.8) is (@) pea () p=20 © p=39 (@ 9=3p Sok Value of 2 at (34) is 3p+4q and that at (05) is $9. According to the given condition sp+4q=5q = 0=3p Ans: (d) Region represented by x20, 2048 (0) fist quadrant (b) second quadzant —_(@) third quadrant ——_(4) fourth quadrant Ans: (@) 3. Objective function of a LP-Pis (@)aconstant (6) a function to be optimised (0) elation between the variables (@) none of these Sok: Objective function is a linear function (of the variables involved) whose maximum or minimum value is to be determined, Ans: (b) 4. The comer points of the feasible region determined by the system of linear constraints are (0.10).(5.5)(15.5},(0,20), Let Z= px +ay, where p.q,>0. Condition of pand q so that the maximum of Zoccurs at both the points (15,15) and (0,20)is (@) p=a () p=24 (9-2 (d) a= Sok: Value of 2 ~ pray at (15.15) is 1Sp+15g and that at (0.20)is 204. According to the given condition, we must have 1Sp +184 =209 = 1Sp=Sq=> 9=3p Ans: (d) 5. The optimal value of the objective function is attained at the points (aon X-axis (b)on F-axis (c) which are corner points of the feasible region (4) none of these Sol: When we solve an L.P.P_ graphically, the optimal (or optimum) value of the objective function is attained at comner points of the feasible region, Ans: (2) 6. The segion represented by the inequalities x2 6.92 2.204 yS10,x20,y20is (a) unbounded )a polygon (©) exterior ofa traingle (@ None of these Sok Let ix=6 hy:y eetes 0 Iy:x-oand kiy-o The graph of the inequalities 2y+y<10, x20.) =0i9 the region bounded by A4OB. This region has no point in common with the region x>6,y>2as is clea fom the figure. Hence, the region of the given inoqualities is an empty set. Ans: (d) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 7. Solution set ofthe inequality x20:s (a) half plana on the lat of Y-axis (b) half plane on the sight of Y-axis excluding the points on Y-axis {) hal plane on the right of Y-axis including the points on V-axis (a) none of these Sok: Solution set ofthe given inequality is {(+,y):+20}i., the set ofall points whose abscissae are non-negative. [All these points lie either on Y-axis or on the right of Taxis Ans: () Feasible segion for an LPP is shown shaded in the following figuse. Minimum of Z= 4x +3y occurs at the point (a) (0.8) ©) (2.5) (© (43) (@) (9.0) Sol: Construct the following table of functional values Corner Point | Value of 2= 4x +39 (0.8) 40434824 (5) 424345223 (4.3) Peres (9.0) 4934 Ane: (b) 9. Ian LPP admite optimal solution at two consecutive vertices of the feasible region, then (a) the requised optimal solution is at the midpoint of line joining these two points (b) the optimal solution occurs at every point on the line joining these two points () the LPP under consideration is not solvable (4) the LPP under consideration must be reconstructed Sok: If the optimal solution occurs at two consecutive vertices of the feasible region, then the optimal solution ‘occurs at every point on the line joining these two points. Ans: (b) 10. The feasible region of an LP-P is always (a) aclose set (b) anunbounded set (¢) a bounded set (@) a convex set Sol: The feasible region of an L.P-Pis always a convex set Ans: (d) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 un. B 4 The shaded region In the following figure, is the solution set of the inequations. (30) (80) (a) Sy+y2are2yc8xB0y20 (b) Br+yS9xe2y>8rE0,y20 fo) xy 9, Sol: Clearly, the inequations are aeeysoxe2ycgx20y20 Ans: (c) Optimization of the objective function is a process of (a) maximizing the objective function (b) minimizing the objective function (©) maximizing or minimizing the objective function (4) none of these Dy <8,x20,920 (@) Sx y=9.x42y>8x 20,920 Sol: Optimization of objective function is the process of maxinnizing or minimizing the objective function Ans.) The feasibl Maximum of Zoccurs at —4y, be the objective function. (a) (5.0) © (65) (© (68) (@) (410) Sok Clearly, Z/5)=13is maximum Ans: (a) Comer points of feasible region for an LPP are (0.2).(3,0).(6.0).(6.8)and (0.8). Let F 4x +6y be the objective function. The minimum value of F occurs at (a) (0.2) only (b) (3.0) only (c) the mid point of the line segment joining the points (0,2) and (3,0) only (4) any point on the tine segment joining the points (0,2) and (3,0) Sok We have, F=4x+6y Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 16 18 Now minimum occur at two points (0,2) and (3,0) ‘Thus minimum value occurs at any point on the lin joining the points (0,2) and (3.0) Ans: (d) Comer points of the feasible region determined by the system of linear constraints are (0,3),(I.!)and (3,0). Let Z= pr+qy where p.g.>[Link] on p and q s0 that minimum of Zoccursat (3.0) and (11) is 4 (a) p=» (&) p= Sok We have, Z= pray. By data Zain OCCU at (3.0)and (LL) (© p=34 @ Seapeq S2pmq = p= Ans: (b) Inan LPP, if the objective function Z=ar-+by has maximum value 7S at two comer points of the feasible region, then the value of every point on the line segment joining these tro points is @) 2s (75 oe us Sok If an LPP attains maxionam value at two consecutive comer points ofthe feasible region, then optimal solution occurs at every point on the line joining thee two points. Hence the value of every point en the Eine joining these two points is 75 Ans (b) 7. One of the commer points of the following problem maximize Z=3:+4y subject to the constraints s+ yS4.220,920 is fa) (4.4) © (40) © (43) (@) (34) Sol .3(0.4) Comer points are (0.0).(4,0),(0.4) Ans: (b) Comer points in the feasible region determined by the constraints are (60,50),(49,60),(0,60),(0,0). Let Z=ax-+éy where a,b >0, then the condition on a and @ 50 that the maximum of Z occurs at (60,50),(40,60) is (a) b= 2a ( o=4 © a=8 (a) a= Sok: Value of 2 is maximum at (60,50) and (40,60) at (60,50). Z =60a~50b and at (40,60), 2~ 400+ 608 we must have, 60a+ 50) =40a + 600 = 200-105 = b=20 Ans: (a) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 18, The comer points in the feasible region determined by the constraints are (0,2)(3.0),(6,0)(68),(.5). Let Z=actby where a.b>0, then the relationship betwoon @ and 6 so that the minimum Z occuss at (0,2) and 0) & (@) 2b=30 (0) 35-20 @a=8 (@) 4a=2 Sol: Value of Z at (0,2) is 26 and thatat (3,0) is 3a According tothe given condition we must have 3a=25 ‘Ans: (@) 20, If x+yS2,x20, 20, then the point at which the maximarm value of Z=3¢-+2y is attained will be {@) (0.0) w(t) (0.2) @ (20) Sol: From the figure, comer points are (0,0),(0,2) and (2,0) Comer polat Z~3x+2y (0.0) ° (0.2) 4 (2.0) 6 ‘maximum value occurs at (2,0) Ans: (d) ‘One mack questions 21, Define Linear Programming Problem. ° Answer: A LPP deals with the optimization (maximization/ minimization) of a linear function of two variables (say and. y') known as objective function subject to the condition that the variable are non-negative and satisfy a set of linear inequality (called linear constraint) 22. Define an objective function. ® Answer: Linear function 2~ a+ by, where ‘a’ and 'b' are constant, which has to be maximized or minimized is, called linear objective function, 23, Define constraints. e Answer: The linear inequalities or restrictions on the variable of an LPP are called constraints, 24, What ace decision variables? e Answer: The non-negative variables of a linear programming problem are called decision variables. 25, Define feasible region. ° Answer: The common region determined by all the constraints including non-negative constraints x20, y0 of an LPP is called feasible region. 26, Define feasible sotution. ° Answer: Points within and on the boundary of the feasible segion for an LPP represent feasible solutions. 27. Define optimal feasible solution. ° Answer: Any point in the feasible segion that given the optimal value (maximum or minimum) of the objective function is called an optimal feasible solution. 28, Define optimal value of LPP. e Answer: The maximum or minimum value of a objective function subject to given constraints of A L.P-P. is called optimal value, 28, Define infeasible solution. ® Answer: Any point outside the feasible region is called an infeasible solution. Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 30. Define comer point. ° Answer: The point of intersection of two boundary lines which lies in the feasible region of a LP-P. is called comer point 31, Define optimal solution in linear programming problem. ° Answer: Any point in the feasible region that gives the optimal value (max. or min.) of the objective function is called an optimal solution. Six marks questions 52. Maximize = 50x +15y subject to constraints: $+ y 00,24 760.2920 ° Answer: The objective function is z= 50x =15y Constiaints are 5x4) £100,249 < 60.3.9 20 Consider sx+y-=100 Put y=0.x=20. The pointis (20.0) 7100, The point is(0,t00) (mark) (0,0)lies in the half plane of 5x+y<100 —_(:,0+0< 100 which is true) Consider x+y =60 Puts =0,y'= 60 and y=0,x=60 The points are(60,0) and (0,60). (0.0) lies in the half plane of x+y <60 (mark) The shaded bounded region Q.43C is the feasible segion of the given LPP. (mark) The comer points are O(0,0),(20.0), (10,50) and (0.60) ‘Corer points (0.0) 0 (20.0) B(10.50) €(0,60) (mark) (oxo ox +15 (mark) Maximum value of (mark) 30 40 50 60 38. Maximize, 2=—214y subject to v+2y8,30+2y512,20,y 20 ® Answer: 2 Sx+4y Changing the inequations ++ 2y'<8,3s+2)'<12 into equations, (mack) 6 a (marty Te points are(4.0) and (0.6) Solving (1) & (2) we get point of intersection of these two Hines as (2,3) Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank Linear Programming 8 The feasible region is the shaded region O4BC (mark) The comer points ofthis region are O(0,0)-4(4,0).8(2.3)C(0.6) (mark) The value of z at these points are Comer points 20.0) ° (40) 12 B(2.3) 6 (mark) (0.4) 16 Snax “16 at (0.4). Fein ~-12 at (4,0) (mark) 2y,subjectto 264 y 28.8 e) a 263 Anstwer: Minimize Changing the in equations 2x+y23,r+2y26into equations, 2 =6and solving these two equations we get point of intersection at (0,3) Consider 2+ y Consider +429 points ae(60) a (0.3) (mark) The feasible region isthe shaded region which ix unbounded (mark) The comer points ofthe segion are 4(6,0) and (0.3) (mack) -4(50) 30,3) } (mask) The minimum value occurs at two points 46,0) & 3(0,3) x (mark) LPP. has infinitely many solutions, attained at every point on the line joining the points 4 and B ie, ~ The region 7 <6 ie, x+2y | Novofunitsof = | Cost iguid_| x Sx 2 : 300% by |» 2 y ay 2003 Total seep ae+2y tay 300% +200 Problem is to minimize 2 = 300+-+200y subject to constraints Sey 2102+ 2y212.¢44y212 and £20,920 (mack) 19,28 +2 Changing the inequalities into equations as $+ Consider Sx +y'=10 1h points ar 420)2(010) The line 48 represents the equation Sx + y=10 (1 mack) Consider 2 Put (1 mark) The line CD represents the equation 2x: Consider v+4y=12 3 ‘The points are £(12,0) (0,3) Put x: seeyi0 2re2y=12 The line EF represents the equation + +4) 0 and 2x+2y=12 is The point of intersection of 5+ The point of intersection of 2x-+2y =12 aad x-+4y 2 is (4,2) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming The point of intersection of x-+4y=12 and Sx+ y-=10 is (28/19,50/19) (mark) The feasible region isthe shaded region BGHE which is unbounded The comers points are B(0,10)G(1.5)# (4.2).2(I2.0) Comer points | 7=300x +2003 cts) 1300 (42) 1600 (0.10) 2000 (12.0) 3600 (1 mask) ssn =1300 at (15) In order to minimize the cost it should produce 1 bottle of liquid product and 5 bottles of dry product. (1 mark) A manufacture of electronic circuits has a stock of 200resistors, 120 transistors and 150 capacitors and is required to produce two types of circuits 4 and 8. Type requires 20resistors,10 transistors and 10 capacitors. ‘Type 2 requires 10resistors, 20 transistors and 30 capacitors. If the profit on type circuit is Rs 50 and that on type Bis Rs 60, Formulate this problem as an LP.P, so that the manufacturer can maximize his profit. Also solve this L.P.P. to find maximum profit. Answer: Circuit | No. of resistors | No. of transistors | No. of Capacitors | Cost 4-x_| 206 10x tox Rs. 50 By | toy 2oy 30y Rs.60 Total_| 20x+10y lox-+20y tox=30y 50x = 609 Maximize 2=50s+60) Subject to constraints 20% 1 lox +20y'<120> lox=30y<150. x+3y xzoy20 To find the feasible region, Consider 2x +y-20 When =10 xe2y x-Oy-5 -0x-12 When oy | the point as) PP Feasible region is OABCD. 29 che points are(10,0) avd (0,20) y-+3 | The points are (12.0) and (0.6) 10 $2005 2x+ 520 2D <15 ts are(15.0) and (0,5) The comer points are 0,(10,0),8(9.2).6(6.3),D(0.5) ‘Comer points (0.0) (10,0) 39.2) 370 (6.3) 280 Dios) 300 o (mark) (mark) (mark) (mark) (mark) Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank Linear Programming 8 a Zac =570 ‘Maxinuum profit is Rs.570 (1 mack) A soft drinks form has two bottling plants, one located at and the other located at Q. Each plant produces three different soft drinks 4.5.C . The capacities of two plants in numbers of bottles per day, are as follows. Product | Plant » | Plantg 4 3000 | 1000 5 1000 | 1000 c 2000 | 6000 bottles of 4.16,000 A market survey indicates that during the month of April, there will be a demand for 240 bottles of fand 43000 bottles of C. The cost of running the two plants P and Qare Rs.co0o and Rs 000 respectively per day. Find graphically, the number of days for which either of the two plants P and Q should be ran in the month of April so as to minimize production cost while still meeting the market demand. © Answer: Let the plant p run for x days and Q run for y days. The total cost of sunning is Rs (6000x +8000) The objective function is 7= 6000x+8000y which to be minimized. (mark) No. of Productions Cost of Plant . working days 4 B c running, P x 3000 L090 200% 6000 Q y 10009 Lo00y o0ay ‘s000y Total 3000x + 10009 1000x + 10009 2000s + 6000 6000s + $0009 The constraints are, x20,y20 ‘3000x + 1000) 2 24000 s+ y 224 1000x + 10002 16000 x+y 216 2000 + 6000) 2 48000=> x+3y224 To find the feasible region we have to draw the lines 3x4 (2mark) Consider 31+» y=0,y=24) When The point ar.) a (0.28) 16 ig) The points are (16,0) and (0,16) x+y Wren * ‘The points are(24,0) and (0.3) 0y=8] =0,x=24) The feasible region is BCD which is unbounded. The comer points are 4(24,0)3(12,4)C(4,12)D(0.24) ‘Corner points | z= 6000x+8000y 4(24.0) 1.44.00 Goon 3(12.4) 1,04,000 (412) 1,20,000 (0,24) 1.92000 (1 mark) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 The minimum value is 1,04,000 when the plant P is sun for |2days and plant@ for 4 days. [> 6000% + 8000 <1,04,000= 3x + 4y < $2 has no common point with feasible region] (mark) 42. A dietician was wishes to mix together two kinds of foods and "in such a way that the mixture contains at least 10 units of vitamin 4.12 units of vitamin 5 snd Sunits of vitamin C. The vitamin contents of one kg food is given below: e Food | Vitamin 4 | Vitamin 5 | Vitamin x ia 2 3 y [2 2 1 (One kg of food x costs Rs. 1Gand 1 kg of food 7 costs Rs. 20. Find the least cost of the mixture which will produce the required diet? Answer: Let the mixture contain rkg of food_¥ and_ykg of food Food | Amount | Vitamin 4 | Vitamin 5 | Vitaminc | Cost x [are [a 2 be Retox [og [as 2 y Re.20) Total x2 seep [163209 Problem isto minimize 2 =16x +20, subject to constants x4 2y 210.26 29 212 OR x+y 26364y28 and 20,72 (mask) Tofind the feasible region, Consider x 10 a y=0,x=10) When lhe points are 4(10,0) and 3(0,8) ® §} the points areC(6.0) and 2(0.6) ® 3 (0 | the points are z( 0} and F(0.8) (amarky (mark) The feasible region 421GF is unbounded The comer points are 4(10.0)77(2,4)G(1,5) and F(0,8) (mark) Comer points | 2=16x+209 40.0) | 160 za) [an . Iee420y=112 (hs) is F(08) 160 (amarky ‘nin =112 at (2.4) Cost is minimum when 2 kg of 2X food and 4'kg of food ¥ are mixed ‘The graph of the inequality 16y+20y <112 or 4x +S) <28 has no point in commen with feasible region, the min of = b (mark) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 43, Sahana wishes to mix two types of food and Q in such a way that the vita af least |2units of vitamin and 10 units of vitamin 5. Food pcosts Rs.30/kg and Food Q costs Rs. 50 /kg, Food Pcontains3 units/kg of vitamin sand Sunits/kg of vitamin 5 while food contains 4 units/kg of contents of the mixture contain vitamin aand2 anit of itn 2 Determine the mini cost of he mists ® Answer: LetSahana mix x kgf food P and. kg. ood 9 Food Quantity Vitamin Vitamin 3 ost > vkg x = 20 2 vkg 4 40) Total aes sry 303505 Problem sto minimize 2 =50¢+ 309 (umask) Suljct to contigs 2x-+4y212,5¢+ 2y 210.8209 For feasible region consider -+4y=12— (2) when $797} te points ae (4.0) 8 3(0.3) 7 % ®lm te 9e(20) a 408) (ama) The feasible region is 42D which is unbounded, come point are (4.0. 2(2.!9) fos Ses Sy=12 ors S0y 44.0) 10 (si aia 7 See2y=10 syeayai2 (1 math) 50 The minimum cost ofthe mixture is Rs. 120. [302+ 50y'<120 ie,3x+5y'<12has no common point with the feasible region ] (1 mark) 44, A manufacturer produces nuts and bolts. It takes 1 hour of work on machine 4 and 3 hourson machine 3 to produce a package of nuts, while it takes 5 hours on machine 4 and 1 hour on machine # to produce a package of bolts. He earns a profit of Rs. 17.50 per package on nuts and Rs, 7.00 per package on bolts. How many packages of each should be produced each day so as to maximize his profil, if he operates his machines for at the most 12 hows a day. ° Answer: Let the manufacturer produce x auts and _y bolts, tem | Number of packages | Time on machine 4 | Time on machine 8 | Profit Nuts | x xh axis Bolts | > phe phe Total x43y ax Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 Problem is to maximize z=*5s+7y (mark) Subject to constraints x+3y<12, 3x+ysi2and x20, y20 (mark) To find feasible region, Consider x+3y=12 ...) 774 thoi 40.4108 2 (mark) ea b | me points ate (4.0) (0.2) ‘The feasible region is the shaded portion OCEB which is bounded. The comer points are O(0,0), C(4,0), £(3.3). 3(0.4) (mark) 3 (Comer points (0.0) 0 (4.0) 70 £Q.3) (mark) 30.4) 28 The maximum profit is Rs. 73.50 when 3 packages of each of nuts and bolts are manufactured (mark) 45, A merchant plans to sell two types of personal computers, a desktop model and a portable model that will cost Rs, 25000 and Rs, 10000 respectively. He estimates that the total monthly demand of computers will not exceed. 250 units. Determine the number of units of each type of computers which the merchant should stock to get ‘maximum profit if he does not want to invest more than Rs. 70 lakhs and if his profit on the desktop model is Rs, 4500 and on portable model is Rs. $000. ° Answer: Let the merchant stock x desktop computers and _y portable computers Type_| Number | Cost percomputer | Investment Profit Desktop | Rs, 28000 Rs. 25000x Rs, 45008 Portable | y Rs, 40000) Rs. 40000,» Rs, 50007 Total | x+y 2so00x+40000y | 4800+ S000 (mark) Problem is to maximize Z = 4500x+S000y Subject to constraints, 25000v + 400007 s 7000000 or Sx+8y 51400 +9250 (mark) and x, y20 Copyight Ace Creare Leamang Poti, | [Link]PU-Question Bank Linear Programming 8 For feasible region, Consider Sx +8y=1400 X 250 Ex+8y=1400 175) when *~°2=175| che points are (280, 0), B(0, 175 Meng = ago} THe Points are 4(280,0),3(0.175) (mark) 250) seoh The Points are C(250, 0) and D(0, 280) The feasible region is the shaded portion OCEB which is bounded. The comer points are O(0,0), C(250,0), £(200, $0), (0,175) (mark) Comer points i500x + 50007 (0,0) ° €(250, 0) 1125000 £ (200,50) 1150000 (mark) 3(0,175) 875000 The maximum profit is Rs. 11,50,000 when 200 desktop and 50 portable computers are stocked, mark) 46. A factory makes tennis rackets and cricket bats. A tennis racket takes 1,5 hours of machine time and 3 hours of, crafiman’s ime in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftsman’s time. Ina day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman’s time, (i) What number of sackets and bats must be made if the factory is to work at full capacity. (ii) If the profit on a racket and on a bat is Rs. 20 and Rs. 10 respectively find the maximum profit of the factory ‘when it works at full capacity? ®) Answer: Let + number of rackets and_y- numberof bats are to be made by the factory Item Number | Machine time | Craftman’s time | Profit Tennistacket | x Be Sehrs Rs, 20% Cricket bat y ay iyhr Rs. 10y Total sey | Beasy Srey 20x=103 Problem is to maximize subject to constraints Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 x+y and P=20x+109 +3yS42 or 42528 (1 matk) axsys x20,y20 To find feasible region, Consider x+2y=28 1 28 Fig. (1 mark) he points are 4(28, 0), 240.14 | the points are €(S,0) and (0,24) . 4 (A mark), ‘The feasible egion isthe shaded portion OCED v2y=28 The comor points aro O(0,0), C(8,0). (4.12). B(0.14) (mark) Comer points | Z=3+y P= 20r~+103 0(0.0) ° (6.0) 8 160 (4,12) 16 200 (1 mark) (0,14) 4 140 Factory should make 4 tennis rackets and 12 cricket bats to make use of fall capacity Profits also maxizium equal to Rs. 200 ([Link]) 47. An aeroplane can carry a maximum of 209 passengers. A profit of Rs. 1000 is made on each executive class ticket and a profit of Rs. 600 is made on each economy class ticket. The airline reserves at least 20 seats for executive class, However af least 4 times as many passengers prefer fo travel by economy class than by executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline, What is the maximum profit? ) Answer: Let * passengers travel by executive class and passengers by economy class Clas | Numberoftckes | Frfit Feectve [= Be lows Feonony | 3 we wos Teta os “he problem st maiming 2 Brand 0 Nitrogen 3 as Phosphoricac | 1 Potash 3 bs Chlorine 1s 2 Answer: Let the fruit grower mix x bags of brand P and y bags of brand Q. Amount of | Amount of , eo | No-at page ‘Amount of Potash | Amount of Chlorine Nitrogen | Phosphoric aid 3 P x akg kg arkg, aks 2 y ayke Sy kg ay ke Total xe2y aet5y Problem is to minimize Z= 30+ subject constrains, 292280 sev yzzv0 01 242180 Seay nto of axs4yse20 mast) 20,920 To find the feasible region we have to construct the constraints equations 240 Consider +29 when y When x=0, 50 0.x 90 20 the points are (240,0) and (0,120) vee 170% pst (0) srvay=620 (mark) When 27 90*=2066 yy (hmark) | aa tay 6200xt 2y = 240 The feasible region isthe shaded region ABC det y=180 (mark) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 The comer points are (40,100), (140,50).C (20,140) ‘Comer points (40,100) (140,50) ©(20.140), (mark) Amount of nitrogen is minimum equal to 470ks when 40bags of brand P and 100 bags of brand Q are mixed (mark) 50, There are two types of fertilizers Fand F:.F, consists of 10°%nitrogen and 6% of phosphoric acid and F consists of 5% of nitrogen and 10% of phosphoric acid. After testing the soil conditions, a farmer finds that he needs at least 14 kg of nitrogen and 14 kg of phosphoric acid for his crop. If F costs Rs 6/kg and F) costs Re5 ‘ka, determine how much of each type of fertilizer should be used so that the nutrient requirements are mot at 2 minimum cost, What is the minimum cost? ° Answer: Let the farmer use x kg of Fjand ykg of Fy ‘Type of fertilizer | Quantity | Nitrogen content | Phosphoric acid content Cost A x ox x ’ sy Total toy ox+3y 100” 100 The problem is to minimize Z=6=+59 Subject to constraints = +2 10730 14> 2x+y22 SE IY 1425 aye sy 2 700 00 "100 x20,y20 To find the feasible region, we have to construct constraints Consider 2+ y= 280 vel - | the points are (140,0) and (0,280) y=280/ °P (140.0) and (0.250) ax 8y=700 1 (tac) The feast regonsthe shaded region ABC whichis unbounded. The comer poinbare 4{%.9), a(n.) and (028) (ma) Comes point : A(700/3,0) 1400 0080) 0 (as 10 «may Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank The graph of the in equality 6x +5y<100 does not have any point in common with the feasible region. Hence minimum cost is 1000 rupees when 100 kg of F,and 80 kg of Fare used. Linear Programming Q (umask) Satish ants to invest at most Rs. 12000 is bonds and 3. According to the rules, he has to invest Rs. 2000in bond 1and at least Rs. 4000is bond 2. If the ate of interest on bond is 5% pa and on bond Bis 1% pa. How should be invest his money for maximum interest? Answer: Let Re t and Rs ybe the amount invested is bond 4 and_2 respectively. Name of bond | Amount | Bond 4 | Bond 5 Interest o : & 3 > iy 100 Total =) ‘Selo 100” 100 & oy “The problem isto maximize 7 = 5% 19 sajectto Pre 100 100 id sey i200 r x 22000 + ston > 4000 For feasible zegion Consider +» =12000 When ¥=0,7=12000 000and y= 4000 1=12000(0,2000)and(12000,0) are points 1€(2000,10000) 4(2000, 4000) ‘Ofioof soo x= 2000 The feasible region is the shaded region 4BC which is bounded The comer points are 4(2000,4000) , (8000, 4000), (2000,10000) Comer points 2288 107 {00100 72000.1000) so 3(8000.4000) 1080 C(2000,10000) 6 ‘The maximum interest is Re 1160 if Satish invests Re 2000 on bond [Link] Re 10000 on bond 2 ‘0600 i) (mark) (mark) x (mark) (mark) (Lmack) (mark) Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank Linear Programming 8 52. A dairy farm can buy two types of cattle feed, viz type and type 3. The nutrients in the two types and the minimum requirements of each row are given in the following table: Nutrients Nutrients contained in Minimum a 2 requirement PB 180 30 540 5 60 180) r 100 30 500 ‘Types Aand B cost Rs 100 and Rs 20 per kg respectively. Formulate an ZPPto minimize cost ©) Answer: Let rand _y be the number of kgs of the two types of cattle feed aand 3 Type of | Noof | Nutrients Cost cattle feed | kgs |p a r 4 x 180% 15x 100 100% 3B 5 30y oy soy 2oy Total 180x+30y | 15x+60y | 1008+ Soy | 100r+20y The problem is to minimize Z=100s+ 20y Subject to constraints, 180x+30y2 S40 or Gx+y218 (mark) ISx+60y21800r v+4y212 z 100r+ S0y 2500 or 2+y210 x20,y20 For feasible region, we have to construct the constraints. Consider 6x=y=18 x0. When } the points are (3,0) and (0,18) J =} the points ave (12,0) and (0.3) pins we (50) (210) | vans eosreis rete (mask) The feasible region is the shaded region 2c which is unbounded, The comer points are 4(12.0)5(4,2)C(2,6)D(0.18) (mark) Corner points 008 +209 (12.0) 1200 (4.2) 440 c(2.8) 320 (0.18) 260 (mark) Zonisinnomn = 320 (1 mark) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 53. A company can produce two types of shoes. Each shoe of the first kind requires thrice as much time as the second kind. The company can produce a total of 600 pairs a day. Only, a maximum of 150 pairs of the first kind and 400 of the second kind can be sold a day. If the profit per pair of the first kind is Rs 400 and per pair of the second kind is Rs 150, find the optimal product max to be produced to maximize profit () Answer: Let x number of shoes produced of first kind y number of shoes of second kind. Since each shoes of first kind required 3 times as the second kind, and the maximum possible production is 600 pairs, we have 3: +» <600 Since only a maximum of 150 pairs of first kind and 400 pairs of the second kind can be sold, we get x<150,y'<.400, The problem is to maximize 100% = 1S0y Subject to constraints 3x + »'< 600 x 5150,y'< 400 (1:mark) Consides, 3x £=0,)=600 When | the points are (200,0) and (0,600) (1 mark) 200 : (mask) The feasible region is shaded region 480 200 The comer points are 4{ °, 400 3(150.150)¢(150.400) (mark) ‘Comer points Z = 400841509 00) acto (50.150) 2500 (050,400) 120000 © (marly Sos -e0 ans Zaman ~}:20000 when the company produces 150 shoes of fits kind and 400 shoes of second ind. (1 mark) 51. One kind of cake required 200g of flour and 2S gm of fat and another kind of cake requires 100 gms of flows and SOgms of fat. Find the maximum number of cakes which can be made from Sk of flour and kg of fat assuming that there is no shortage of the other ingredients used in making the cakes. Formulate the above as LPPand solve. ° Answer: Let x and y be the number of cakes that can be manufactured of the two kinds The problems is to maximize Subject to constraints 0.2y +0.1yS5 0.025 +0.05y< xy20 (1:mark) To find the feasible region Consider 0.2x~0.1 =0.9=50) | the points are (25.0)and (0,50) Wen Poel 0.025" +0.05y (1 mark) the points are (40,0)and (0,20) Coppight Ace Creare Lesming Pot | wow [Link]PU-Question Bank Linear Programming 8 The feasible region is the shaded region O4BC t The comer points aro 0( 040) 4(28.0)8(20.10)C(0,20) (mark) Comer points Zany 4100) a (1-mark) (25.0) 2s (20,10) 30 (0.20) 20 (mark) O2x+0ay 0.0251+0.05: Zansaus =20;When 20cakes of 1% kind and [Link] of 2% kind are to be produced (1 mark) 55, A firm plans to purchase at feast 200 quintals of scrap containing high quality metal .¥ and low quality metal ¥. It decides that the scrap to be purchased must contain at least 100 quintals of and not more than 35 quintals of . The firm can purchase the scrap from two supplies sand 3in unlimited quantities. The percentage of .V and_Y'is terms of weight in the scraps supplied by and 3is given below. Metals Supplier 4 Supplier 3 x 759% v 10% 20% The price of 4's scrap is Re 200 per quintal and that of 2's is Re 200per quintal, Formulate this as a LPP and solve to minimize total purchase cost. ) Answer: Let and y'be the number of scrap bought from the supplicr’s 4 and B respectively Since it must buy at least 200 quintals , we have x+y 2200 Wehave 0. 40.759 2100 Scrap must not contain more than 3Squintals of metal”. Since the scrap from supplier «contains 10% of ¥ and that from 2 contains 20% of ¥, we get ox +027 and x.y20 ‘Minimize Z =200: + 400 Subject to constraints ++ 2200 0.284 +0.78y 210008 x +392 400 Ox 02 £3808 «+292 350 200 (mark) | the points are (200.0) and (0,200 x-200) (200.0) and (0,200) =a) «we oo te pints ac (2090)an (0222 Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 Y (mark) the points are (350.0) and (0.17 Fig. (1 mack) The feasible region is the shaded region 24 The comer points are 2(100,100) 4(250,50)¢(50.150) (mark) ‘Comer points Z= 200% 4009 (100,100) ‘60000 : B(250,50) 70000 aca (250,150) 76000 (a mark) Minimum Z =60000 when 100 quintals of scrap should be bought from each of suppliers 4 and mark) 56. A company manufactures two types of products and 2. There each unit of product Arequires 10 hours of machine 14; and 20hours of machine M2. Each unit of product requires 1Shours of machine Mand 16 es Myand My are 3000 hrs and 4000h15 respectively. The product cost for the company on each unit of is Rs 2000 and on each unit of 3 is Rs 3000. hours of machine M). The maximum time available on 2 mad Formulate this as an LPP and maximize the profit for the company. e Answer: Let x be the number of number of units of product aand_y be number of units of product 3 Product | Units | Machine 4; | Machine Cost 4 s_ | tox 20x 2000 3B y | asy sy :3000y Total lox +15y 2ox +16y 2000 + 3000 The problem is to maximize Z ~ 2000x + 2000y Subject to constraints 10x +15y <3000 or 2x + 3y< 600 20x +16y $4000 or Sx-+-4y £1000 x,y 20 (mark) For feasible region Consider 2 +39 =600 When y=0,x=300and x=0,y'=200 The points are (300.0) and (0,200) (mark) Sx +4y=1000 250 When 1 points are (200.0) and (0.250) Ven oc = aon} Me Pointsare (200.0) and (0250) > Fig. (1 mark) ‘The feasible segions is the shaded segion Q4BC The comer points are O(0,0).4(200.0),.8(600//7,1000/7),c(0,200) 400} (mark) Commer points | Z=2000x +3000 010.0) 0 4(200,0) “s00000 3(600/7.1000/7) | sos600 (0.200) 1600000 ‘Maxinnum profit ~ Ras00000 Coppight Ace Creare Leamang Pot Li, | wow dakePU-Question Bank Linear Programming 8 There are two factories located one at place Pand the other at placeQ. From these locations, a certain commodity is to be delivered to each of the three depots situated at 4.8 and C.. The weekly requirements of the depots are respectively 55nd 4 units of the commodity while the production capacity of the factories at and Q are respectively 8 and 6units, The cost of transportation per unit is given below. FronyTo Cost (in RS) a 2 © 2 10 100 | 150 2 100 120 | 100 How many units should be transported from each factory in order that the transportation cost is minimum. ‘What will be the minimum transportation cost? °) Answer: Let x units and yunits of the commodity be transported from the factory at Pto the depots at 4and respectively, (g-=—y)units will be transported to depot at C Wehave v>0,y>0,8-x-y20,34y<8 A requires $ units. Since + units are transported from the factory at P, the seaming (5~ x) need to be transported. from 0 S-x205%25 Similarly (5~y) and 6-(5—x 4units are to be transported from @ to # and C respectively, S-y20,x4y-420 ie, ySSxtyE4 Total transportation cost Z = 160x + 100y =100(5~x)=120(5—y)=100(x+»—4)=150(8-x-y) Minimize z 10(x—79+180) subject to constraints y XEO,y2OK+YESNES YE typed x (1:mark) (mark) The feasible region is bounded which is shaded. (4QEFPB) The comer points are (0.4),(0.5).(3.5).(5.3).(5.0) and (4,0) (mark) Corner points 1o(x—7y+190) (0.4) 1620 (0.5) 1550 (5.3) 1740 (35) 1580 (5.0) 1950 (40) 1940 (1 mack) Saget tg 6 unisonPU-Question Bank Linear Programming 8 Minimum value of Zis 1850 at (0.5) The transportation cost is minimum. Factory at Pto deliver 0,$ and 3 units and Factory at @ , 5.0.1 to depots 4.8 and © (1 mark) 58, An oil company has two depots 4and 3 with capacities of 7000L and 40002 sespectively. The company is to supply oil to three petrol pumps [Link] F whose requirements are 4500130001 and 35002 respectively. The distances (in km) between the depots and the petrol pumps are given in the following table. Distance in (km) From/To | 4 2 D 7 E 6 4 FE 3 Assuming that the transportation cost of 10litres of oil is Rs. 1 per km how should the delivery be scheduled in order thatthe transportation cost is minimum? What is the minimum cost? © Answer: Let from dapat 4, «litres of ol be transported to pump Dand y litres of oil to £ [7000 - (x »)}itrs of ois to be transported to pump F. From depot 2,(1500~%) litres of ei to be transported to D and (3000 y) tres of ofl to and [3800-(7000-(x+)) x+y ~3800) litres to pump F Depot | Topamp D | Pomp | Famp F Cosa ensporaton a |e : rom-(a+3) 3000. 3500 5 (4500 x) 4 (3000 »)- 2x 3500) 5 - wee 10 10 - 107 reat [aw | 2000 | 350 = Minimize 2 =~* 513980 Subject to 4500— x2 0= r<4500,3000-y20— y'< 3000 x+y 3800204) 23500 7000-(x+y)205 x+ $7000 x, Gmark) Consider x+, 500 |. = 3500(0.3500),(3500,0) are points x=3500 x+y= 7000 x=0,9= 7000 (0.7000), (7000.0) are points Deeg) (mark) |= 7000 (mark) Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank Linear Programming 8 The shaded portion 48CDE represents the feasible region which is bounded, The comer points are £(3500,0).D( 4500,0)C( 4500,2500) 5 ( 4000,3000) (500,300) (mark) Corner points Zz (3500.0) 500 (4500.0) 5300 {€(4500,2500) 5850 3 4000,3000), 4(500,3000) 4400 (mark) Minimum cost =Rs 4400 (mark) 59, Solve the following problem graphically minimize and maximize 2=3r~9y subject to the constraints N+3y S60; r+y 210 vs prx20,y20 ®D) Answer: Minimize and maximize 2~31+9y constraints +3) $60;4+y210:x5 9,120,920 aay @ xey=10 x] 0 [a x0 [10 y[20fo pio} (mask) Gomark) a 520,920 x [o 5 5 ° 3 (% mark) Comer points | Corresponding value of 2— 3:99 (fig 2 marks) -4(0,10) 0 215.5) 60 min (15,15) | 180max (0.20) __| 180max (marks) From graph, Feasible region is 48CD . From the table minimum value of = is 60 at the point (5,5) of the feasible region, The maximum value of = on the feasible region occurs at the two corner points C(15,15) and (0,20) and itis 180 in each case, (1 mark) 60, Minimize and Maximize 2~3x-9y subject to the constraints x43) S60;x +92 10:x< y,x20,) 20, by the graphical method. en Answer: Given £=3x+9yi0u(Ux+3y$60.0(2) x+y 210.0.(3)2—y $0. (A)x 20,920.08) Taking the inequalities as equal then (2).(3) & (4) become x+39=60 a_|s (Gig 2 marks) zo |6o y |» [eo xty=10 Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 clo x fo [10 vy [wo [o ge |r ro |o (2.10) vy lo fo Solving the equations v+3y=60 and x-y=0 we get F=(15.15) N poo (mark) & solving the equations x+y=10 and x-y=0 we get G~ The feasible region is_4CGF .Itis bounded by the comer points _4(0,20).C(0,10).G(58) & F(15,18) Comer point Corresponding value of 7=3x+9 4(0.20) 180 (0.10) 90 ais) «0 z <—— Marxism (ISIS) 150 Moioue, (@macks) ‘We find that the minimum value of Z is 60at G(5,5) of the feasible region & the maximum value of Zs 150 occur at two points 4(0,20) and F(1S.18) of the feasible region (mark) 61. A diet is to contain at least $0 units of vitamin sand 100units of minerals. Two foods FI and F2are available. Food F| costs Rs. 4 per unit and food F2 costs Rs.6 per unit. One unit of food Fi contains 3 units of vitamin «and 4 of minerals. One unit of food F2 contains 6 units of vitamin 4 and 3 units of imum cost for diet that consists of minerals. Formulate this as a linear programming problem. Find the mi mixture of these two foods and also meets the minimal nutritional requirements, @ED) The above LPP. is given as minimize Z=4x+6y , subject to constraints Brr6y280, 4v-3y2100, xy20 Thetthe above inaguaiienas equal and draw thins (amas) Comerpons | Zaare (1 mas) (so 43") 3 - a aat a my (oi) Tht NN 4x43y2100 Copyight Ace Creare Leamang Pot | ww doekaleanPU-Question Bank Linear Programming 8 (marks) Feasible segion is unbounded segion given by ABCD Here cost is minimum at point 3{ 24.) & minimum cost=Rs 104 (mark) 62. A manufacturing company makes two models < and # of a product. Each piece of model 4 requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of model 3 requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 150 and 30 respectively. The company makes a profit of Rs. 8000 on each piece of model 4 and s.12000 on each piece of modal 5. How many piece of model 1 and 5 should be manufactured per week to realize a maximam profit? What is the maximum profit per week: Formulate LPP and solve graphically. (F, D) Answer: Suppose x is the number of piece of model 4, and y is the number of pieces of model 3, Then total profit 2=8000: +120003 Model - Model- | Availability of Time ®) Oo) Fabricating | 9 1 130 Finishing | 1 3 30 9e+I2y £180 and x+37<30820, 20 To maximize Z =s000r~ 12000» Subject to constrains 3x+4y<60 and. x43y 520,120,920 (mark) Now taking inequalities as equal, we get arsdy=60 ws (20, 0)B=(0,18)C=(30, 0} =(0,10) feasible regions O4ED0 and is bounded region (marks) *, maximum occurs at comer points, (mark) Corner points Z = 8000 + 120009 00.0) ° 4(20.0) 1160000 x £(12.6) 168000 D(0.10) 120000 (mark) company should produce 12 pieces of modal 4 and 6 pieces of model 8 to realize maximum profit and ‘maximum profit then will be Rs. 1,68,000/— (mark) Coppight Ace Creare Leaming Pot | [Link]PU-Question Bank Linear Programming 8 63. A manufacturer makes two types of toys and [Link] machines are needed for this purpose and the time(in minutes}required for each toy on the machines is given below. ‘Type of Toys Machines 1 u u A 2 Is 6 B 6 0 9 Each machine is available for a maximum of 6hours per day. Ifthe profit on each toy of type 4 is Rs 7.50and that on each toy type Bis Rs.5, show that 15 toys of type and 30of type 3 should be manufactured in a day to get max. profit. ©.) Answer: Let number of toys of type number of toys of type The number of minutes of make one unit of toy of each type is given below. Toys Machine! | Machine I! | Machine It | Profit (Rs) A 2 a 6 750 B 6 ° 9 5 Max tine | his Gs hrs available (marks) Max. Profit: Z=7.50x~5y subject to constraints L2xs6yS360ie, 2x+ys60 — x¥20 (2 marks) 6x 499 S360 Le, 2x-3yS120.x,y 20 Comer Points (0.0) ° -4(15,0) 12. F (20.20) 250 £(15,30) (2mars) Therefore Z is maximum at Z(15,30). Maximum profit =8s262.50 Copyight Ace Creare Leamang Pot | ww doekalean