14, Ina linear programming problem, the in ovo unknowns has number of sola ® A particular value of y equation 2¢ay= 12 ons equal to and y : ® maximum value of x © infinite © none of these 15, State which of the following statement is faleer @ The most important feature of a linear” progiammt © The objective Fanetion may assume its optimal value at ‘more them one comer point of the feasible region: Multiple solutions of linear programming problem ate solutions each of which m . h maximize or minimize the objective function or minimize the © Aninfeasible linear programmin, solution, 16, seae wich ofthe following statement fase? @® Anunbounded solution ofa linear programming problem isa solution whose objective function hea © Any linear programming problem is either a problem of maximization or a problem of minimization, © Aproblem of maximization of the objective function Z is nothing but a problem of minimization of the function ~Z. © An LPP may have a unbounded solution. IZ, State which of the following statement is true? @® The constraints in a linear programming problem does not arise due to limitation of resources, 2) The objective function of an LPP may be linear or nonlinear in decision variables. © Ifone can get two optimal solutions, then one can obtain an infinite number of optimal solutions, The constraints of a linear programming problem are not linear equations or inequalities arising out of practical limitations. 18, ‘State which of the following statement is true? ® Ifa linear programming has at least two optimal feasible solutions, then there are infinite number of optimal solutions. ® Ina linear programming problem, the decision variables © and mvininnan value of y. '8 Problem has no feasible @ @ can take any real values, In any problem, it is possible to express both the objective function and the constraints in linear form. The objective function of a linear programming problem with decision variables x and y is of the form ax +by + © where a, b and c are real constants. 18, State which of the following statement is false? ® The objective function of an LPP may assume its optimal value at more than one comer points of the feasible region. ® The feasible region of a linear programming problem is a convex set. © S={(x, yyix2+y2 <4} is a conver set. ® Any solution to a general LPP which satisfies the non-negative restrictions of the problem is called a optimal solution. Hint of the questions marked by * are given after answers QM Matuematics « xi! 20. Stare which of the following statement is falggy 2 heteanibieregon the colecton ofall eg © Given the LPP, Maximize : Z= 2x4 3y A Subject to the constraints grty<3y and x20, 920 ‘The maximum value of © Given the LPP, Mi Subject to the consti 2x+3y>1, and x20, y?0- ‘The minimum value of Z is is 9 jimize Z = 5x~2y lection of all feasible solutions isc © The collection of alle |. Given the LPP, Max. Z=2x+3y Subject to the constraints Bxty<3, x20, ¥20 ‘Show that the comer points of the LPP are (0, 0), (3) Find the optimal solution of the above LPP and they value of Z. 3. What is linear programming? Explain with an exam, 4. Write down two advantages of an LPP. 5, State two limitations of an LPP. 6. Given the LPP, Max. Z= 3x, +2, Subject to the constraints 2x, +1, <2, 3x, +4x, 212, x30, 4,30 Draw the graphs of the constraints, 7, Show that the LPP (given in Question6) has nofeasbiesi 8. Find the corner points of the LPP, Max. Z = 2x+5y Subject to the constraints o0, y20 Show that the LPP has unique optimal solution. Show by graphical method that the fesse veh f the following LPP is unbounded but i has unleee oped solution x=3, y= 18. Minimize Z=4x+2y Subject to the constraints 3x+y>27, -x-yS-21, x+2y230, and x>0, y20 Show graphically that the following LPP has an unbounded solution. Maximize Z= 3x4 4y Subject to the constraints ~2x+3y<9, x-5y 2-20, and x>0, y>0 6. Represent geometrically the following LPP, Minimize Z = 3x-+2y Subject to the constraints Sx+y?10, xty>6, xt4y> 12, and x30, y>0 Find out the extreme points of the convex set of feasible solutions and hence find out the minimum value of the objective function. 7.,Solving graphically, show that the following LPP has an Infinite number of optimal solutions. Minimize Z= x+y 5. ED MaTHEMATICs « xii Subject to the constraints 5x+9y<45, xty>2, x4, and x30, y20 Find also the minimum value of the objective function 4. A Man has & 1500 to purchase rice and wheat. A bag and a bag of wheat cost % 180 and & 120 respective a storage capacity of 10 bags only. He earns a profit of and & 8 per bag of rice and wheat respectively. Hoy q ‘each must he buy to make maximum profit? bags of each mus no 9, A small firm manufactures items A and B. The total ny of items that it can manufacture in a day Is at the mo wn hour to make while item B takes on lable per day is 16 ho % 300 and that on Item A takes 01 an hour. The maximum time avail the profit on one unit of item A be unit of item B be % 160, how many of each type of should be produced to maximize the profit? Solve the pr graphically. CBSE 2000 Kellogg is @ new cereal formed of a mixture of bran and that contains at least 88 grams of protein and at leas milligrams of iron. Knowing that bran contains 80 grarf protein and 40 milligrams of iron per kilogram and that contains 100 grams of protein and 30 milligrams of io kilogram, find the minimum cost of producing this new eq ifbran costs £5 per kilogram and rice costs & 4 per ko [ease ‘A company manufactures two types of toys A and B. 1 A requires 5 minutes each for cutting and 10 minutes 4 for assembling. Type B requires 8 minutes each for cu and 8 minutes each for assembling. There are 3h available for cutting and 4 hours available for assembli @ day. He earns a profit of ¢ 50 each on type A and & each on type B. How many toys of each type should company manufacture in a day to maximize the profit? [CBSE 01, 12. A housewife wishes to mix together two kinds of food, X Y, in such a way that the mixture contains at least 10 u and 8 unit [ese 2 of vitamin A, 12 units of vitamin B vitamin C The vitamin contents of 1 kg of each food are given belaLINEAR PROGRAMMING j wgof food X costs F 6 and 1 kg off and B be sent to C, D and fi ne minima cost ofthe mite whic fm manutactUeS WO TYPES Of Products, A and Ay and ically astemat promt of S perunitottype A and & 4 per ee Jt © ype B. Each product is processed on two machines fant Ma~ ON€ Unit of NPE A requies one ier pecesing time on My andl two minutes of processing sine iM: whereas one unit of wpe B requires one ' ed Y costs % 10, | How should the trucks from A will produce the | 4: go that the total distance covered by the trucks is minimum, | Jem as a linear programming problem and Formulate the prob! 15.11 is prescribed that the daily food ration for a patient must 100 units of vitamin A and 120 units of vitamin contain at least we available for him. Pood B. Two kinds of food, Fy and Fy, contains 6 units of vitamin A and 7 units of vitamin B per nite of or gram; whereas fyod F, — , ram and costs 12 paise per gram; (pod F contains & eesing time on My and one minute on My. Machi gram and costs 12 p iy, and M are respectively availab Coenen sanitsofvitamin A and 12unitsofvitamin B pergramand cost h lable for at most 5 hours | opaise pergram.ttis desired o determine aminimumcost det jupteduct the firm should produce a day in onde, n order geprot, Solve the problem graphically {ease 200) _ asansport company has offices in five localities problem and solve it graphically: +16, A manufacturer produces two inodels A and B of a product ; A,B,C,D juires 9 labour hours for fabric ani E. Some day the offices located at A and B has 6 and Each piece of model A requires 9 | ibour hours for fabricating pspare trucks whereas offices at C, D, F required 6, 8 and and 1 labour hout for finishing, Each piece of model B requires sucks respectively. The distance in kilometres between 12 labour hours for fabricating and 3 labour hour for finishing ‘re localities are given below : eee For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a Es profit of 8000 on each piece ofmodel A and % 12000 on each 3 piece of model B Formulate a LPP os to maximize his profit a per week and solve the problem graphically. [S19] Short Answer Type 16 2®@ 320 40 1. Max. Z= 45x + 80y 58 6@ z © Subject to the constraints 3 10. © "© 2 © 5x+20y< 400, 10x+ 15y < 450, pe 4. © 5. © 6. ® nd x20, y>0 re 8. 90 n. © : agen where x and y are the number of chairs and tables respectively. 2. Min, Z=20x+30y Subject to the constraints Sx + 8y>80, 6x+ 10y> 100, and x20, y30; where x gms offood F, and y gms of food Fy are purchased. 3, Min, Z = 10(x-7y+ 190) Subject to the constraints x+ySO, x55, ySa, x4y>4, o Go and 2>0, y>0; Fig. 27 where x units and y units of the commodity are transported (0,0), (4, 0), (4, 2), (9, 3), (04 3)» from the factory A to the depots at C and D respective 1,0), (3, 0), @, 2), (48, ) 4 (0,0), (4, 0), (2, 3) and (0, 12