- Method and a computer: In this chapter, w'¢ will rest Linear Programming {NTRODUCTION ypu are familiar with Ii and two variables. They can of one variable, and on ady know how to solve ly in solving problems near equations and linear inequations in one be solved algebraically or graphically (by drawing a line diagram in case two dimensional graph paper in case of two variables x and y). We alre dase of linear inequations and we will utilise this knowledge extensive on linear programming. 31 LINEAR PROGRAMMING ina military operation, the effort is to inflict maximum damage fo enely at minimum cost and 1s tries to utilise its resources in the best possible manner. ioss.Inan industry, the management alway rofits, but he is constrained by limited manpower, The industrialist would like to have unlimited p apital and market demand. A salaried person tries to make investments in such a manner that the ‘ame time income tax liability is also kept low retums on investment are high but at the s sented by linear equations /inequations In all the above cases, if constraints are repre (none, twolor more variables), and a particular plan of action from several alternatives is to be uations used and the function chosen, we use linear programming. The word linear mea thatall ineq d the word programming refers to planning (choosing tobe maximized or minimized are linear, an‘ sense. American economist Dantzig, tmongst alternatives) rather than the computer programm iB ject of linear programming credited with developing the su! Thus, linear programming is a method for determining optinuint values of a linear function subject to ‘onstraints expressed as linear equations or inequalities. dis usually solved by using Simplex ens of variables, an A practical problem may involve do7s ict ourselves to linear functions involving two y drawing graph on xy-Plane Vatables, so that they can be solved b Three Classical Linear Programming problems (L.PP.) () Many ue ee He ae Q oie of manufacturing 2X of different products, and each product Tequires a fixed er, machine hours, labour hours per unit of the product, warehouse tae ma Be ee citost etc, it has to choose which products should be produced in What numbers goa to masize the POH i) Diet as prolenigs einai Pee parnoimis of nutcients (vitamins, minerals etc.). In Pitferent kinds of foods 2 mounts of different kinds of foods which shoule of the diet such that it contains a certain minimize the cost(iii) Transportation problems A factory may have different godowns at different locations, and it has to send its products to many places from the stocks at these godowns. The problem is to find out what quantity should be transported from which godowns to which places so that total transportation cost is minimized. Some Definitions Objective Function. If ay, ay.., a, ate constants and x, Xz %, are variables (called decision variables), then the linear function Z. = ax, + 03% + .. + 4%, Which is be to optimized (maximized or minimized) is called the objective function. It is always non-negative. In business applications, objective function of total profit or volume of production is to be maximized while the objective function of total production cost or production time is to be minimized Non-negative Restrictions. The values of the variables x1, %,,...,%, in an L.PP. are always non- negative (2 0). Thus, 1 20,2) 20)... %, 20. For two variables x and y, it means that we will be working only in the first quadrant of the coordinate plane. Constraints. The inequations or equations on the variables of an L.PP. are called constraints. They may be of =, >,>, < or < type. Feasible Region and Feasible Solution The common region determined by all the constraints of an L-PP. is called a feasible region and every point in this region is called a feasible solution to'L.PP. The feasible region is always a convex set meaning that if any two points in this set are joined by a straight line segment, all the points on this segment also lie in the set. Note that first two figures below are not convex sets, but the next three are convex sets. Also note that feasible region may be bounded or unbounded, but itis always "OCZ ~ & Optimal Solution. A feasible solution which maximizes or minimizes the objective function is called an optimal solution. An LPP. may have zero, one or more than one optimal solution. Basic Requirements of Linear Programming ( There must be a well defined objective to achieve (to maximize or minimize). (Gi) There must be limited availability of the resources i. there are constrain ions on the Ao z its or restrictions On iy _usage/allocation of limited resources amongst the competing activities. see ‘number of decision variables (activities or products) and a finite number of (iv) lage ofan L-PP, should be quantifiable, 1 ee‘ i ns oF {@) Both the objective function and constraints must be expressed in terms of linear equatios inequations. : ie (oi Programming/planning requires that these must be alternative courses of line of action there are alternatives available to which resources can be put (oi) All decision variables should assume non-negative values advantages of Linear Programming We have already mentioned a few application areas of linear programming-military operations, choosing optimal product line, diet problems and transportation problems. It helps in choosing, the best alternative from a set of feasible alternatives, so that profit is maximized, or costs are minimized. Some other application areas are (9 Choosing the media mix (radio, TV, newspapers, hoardings, magazines, internet) tomaximize the advertising effectiveness, within given publicity budget. {i Determining shortest routes for travelling salesmen. (ii) Helping a farmer decide best crop mix so as to minimize risk and maximize profit. ‘Thus, the linear programming helps in ( choosing the best alternative amongst a set of alternatives so that profit is maximized or cost Bee ad (i) taking into consideration not only internal factors like manpower, machine, budget, storage ‘availability etc. but also external factors like market demand, purchasing power of the customer ete. ‘identifying bottlenecks in the production process. Dest production policy and inventory policy so that seasonal fluctuations in of Linear Programming with optimizing a single objective. In practice, a number of objectives may be there. 7 that input and output variables are directly proportional is not strictly true. ‘of scale usually ensure that the more you produce, lesser is the average cost. ity of variables assumes that resources required for multiple activities are sum total required for individual activities. However, synergies of product mix usually requirement is less than the sum. “many decision variables assume integral values, ¢g., number of workers. LP haying continuous values. ON OF AN L.PP. IN TWO VARIABLES x AND y ‘the mathematical formulation of an L.PP. and solving it. These are:(iii) ® find the optimal solution i.e, to select particular values of the variables x and y that give the lesired value (maximum /minimum) of the objective function. ILLUSTRATIVE EXAMPLES Example 1. A shopkeeper deals in twvo items—wall hangings and artificial plants. He has 715000 to invest and a space to store atmost 80 pieces. A wall hanging costs him %300 and an artificial plant & 150, te can sell a wall hanging at a profit of 850 and an artificial plant at a profit of €18. Assuming that he can sell all the items that he buys, formulate a linear programming problem in order to maximize his prof. Solution. Let x be the number of wall hangings and y be the number of artificial plants that the dealer buys and sells. Then the profit of the dealer is Z = 50x + 18y, which is the objective function. As a wall hanging costs £300 and an artificial p y artificial plants is 300x + 150y. We are given that tl investment constraint is 300x + 150y < 15000 ie. 2x + < 100 ‘As the dealer has space to store atmost 80 pieces, ant costs %150, the cost of x wall hangings and he dealer can invest atmost 715000. Hence, the we have another constraint (space constraint): x+ys80 Also the number of wall hangings and non-negativity constraints : x20,y20. ‘Thus the mathematical formulation of the L-PP. is, ‘Maximize Z = 50x + 18y subject to the constraints 2x +y<100, x+yS80, x20, y20. artificial plants can’t be negative. Thus we have the Example 2. A retired person wants to invest an amount of upto 820000. His broker recommends investing in tuo types of bonds And B, bond A yielding 8% return on the amount invested and bond B yieling 7% return on the amount invested. After some consideration, he decides to invest atleast ©5000 in bon ‘Aand no more than %6000 in bond B. He also wants to invest atlenst as much in bond A as in bord B Formulate as L.PP. 10 maximize his return on investments. Solution. Let the person invest €x in bonds of type A and &y in bonds of type B, then his eaming ie, return (in ®) Z.= 8% of x + 7% of y = 0.08x + 0.07y. |As the person can invest upto €20000, so investment constraint is x+y S 20000. 4 Other investment constraints are 2.5000, y < 8000, x2 y. ‘Non-negativity constraints are x > 0, y 2 0. "Thus, mathematically formulation of the L.PP. is cimize Z = 0.18x + 0.07y subject o the constraints PIO ear Hs BOD, = ¥. #20, yO, problem) A manufacturer produces nuts and bolts for industrial machinery. It ‘Aand 3 hours on machine B to produce a package of nuts, while t bie i Me to produce package of bolts. He earns a profit of ©25 package on bolts. Form a linear programming problem to maximize his ‘atmost 12 hours. ne. The objective of suppose that x packages of nuts andl y packages of bolts are produced. sottion ertacturer is to maximize the profit Z = 2.50% + 1 MABited ta eed tired fon machine A to produce x packages of nuts and y packages ‘Time 3y =x + Sy, while time required on machine B is 3.x + Ly = 3x + Ys lee ‘given data, we can formulate the LPP. as : Las Aasinil Z = 2.50% + y subject to the constraints r+ 3y <2 (Machine A constraint) grey sid (Machine B constraint) r20,y20 (Non-negativity constraints) Je 4. A mantgfiacturer has three machines My, My and M, installed in his factory. Machines M, and Baik are capable of being operated for atmost 12 hours, wheréss machine My must be operated for atleast Ear, The mzmntelier bien tly items, each requiring the use of these three machines The following table gives the number of hours required om these machines for producing 1 unit of Aor B. [ber of urs requed on the maces tem | | M, M, M; A A c 1 5 B | = l lini : E Hemakes aprofit of 60 on item A and 40 on item B. He wishes to find out how many ofeach item he _ should produce to have maximum profit. Formulate it as L.P-P. units of item B. As he makes a profit his total profit (in @) is we can mathematically formulate the L-PP. as = 60x + 40y subject to the constraints (Machine M, constraint) (Machine M constraint) (Machine M; constraint) (Non-negativity constraints) of minerals, Two F costs €4 per kg and F, costs 85 per kg. One kg of food F contains in One kg of food F, contains 6 units of vitamin A and 3 units am cost for det that consists of mixture of these two foods and requirements. Formulate this as a linear programming problem, kg of food F, and y kg of food F. tional requirement table from given data :Mini i Hon requirement of vitamin A is 80 units, so) 3x + 6y > 80 therehe, ‘Be Minimum requirement of minerals is 100 units, : ‘Also ne 4x + 3y > 100 As cost of food F, is Sine nae the cost of food F, is %5 per kg, the total Purchasing x kg of food F, and y kg of food Fy is Z = 44 + 5y, which is the objective function. Hence, the mathematical formulation of the LPP. is : Minimize Z = 4x + 5y subject to the constraints 3x + 6y > 80, 4x + 3y > 100, x20, y>0. Example 6. (Transportation problem) A brick manufacturer has two depots A and B, with stocks of 30000 and 20000 bricks respectively. He receives orders from three builders P, Q and R for 15000, 20000 an 15000 bricks respectively. The cost (in ®) of transporting 1000 bricks to the builders from the depots ae given below ‘Transportation cost per 1000 bricks (in) | The manufacturer wishes to find how to fulfil the order so that transportation cost is minimum. Formulate the LPP. ‘Solution. To simplify, assume that 1 unit = 1000 bricks ‘Suppose that depot A supplies x units to P and y units to Q, so that depot A supplies (30 - x - y) _ units bricks to builder R. ‘Now as P requires a total of 15000 bricks, it ‘requires (15 - x) units from depot B. Similarly Q requires (20 - y) units from B and R requires 15 — (30 -— x — y) = (x + y - 15) units from B. ‘Using the transportation cost given in table, total transportation cost is Z, = 40x + 20y + 20(30 - x - y) + 20(15 - x) i + 60(20 - y) + 40(x + y - 15) 40x ~ 20y + 1500 ‘Obviously the constraints are that all quantities of bricks supplied from A and B to P, Q R are non-negative, ie. x20,y20, 30-x-y20, 15-x2>0, 20-y20, x+y-1520 Instead of minimizing Z, = 40x - 20y + 1500, it is easier to minimize ‘Z = 40x - 20y. _ Hence the problem can be formulated as L.PP. as Minimize Z = 40x ~ 20y subject to the constraints x4 y 215, x+y S30, x5 15,y< 20, x20, y20. fa gThe maximum number of hours avai . profit on anecklace is 100 and that on a bracelet j lable per day is 16. If the let is€300, formulate an L-PP. for findin how . many of each should be produced daily to maximize the profit? : one of each must be produced, 3, A furniture dealer deals j and a space to store atmost 80 2200. He can sell a table for 8950 that he buys. Formulate this “2 items—tables and chairs, He has %20000 to invest Pieces. A table costs him %800 and a chair costs him for 7280. Assume that he can sell all the items “PP. so that he can maximize his Profit Answers. Pe rumimize Z = 200% + 400y, aublecr ts the constraints Sr + 5y 230, x+y 28, X20, yoo Bo rire Z = 100 4 S00y, eibhect ig the constraints ¥42y S32, x+y s 24 x04, ye1 enamize 2’ 150c/4 8y, subject to the constraints A+ YS10,x+y< 80,220 39 3.3 GRAPHICAL METHOD OF SOLVING AN L.pp. Thefollowing theorems are fundamental in solving LPP. by be the objective function. subject to the constraints described by er point (vertex) ofthe feasible region, =P. and Z = ax + by be the objective function, If maximum and a minimum value on R and “Occurs at a corner point (vertex) of R. y Rot have a maximum or minimum value. )) exists, then by Theorem 1, it must occur at comer point of ly, we follow these steps : constraints into equalities and then draw their graphs which will be of the L.PP. and find the corner points. on Z = ax + by at each comer point, and let M and mbe respectively if the open half plane ax + by > M has no Point in common Z has no maximum value. Linear Programming(©) mis the minimum value of Z if the open half plane ax + by < m has no point in comm, with the feasible region. Otherwise Z has no minimum value. on 6. If two comer points of the feasible region are both optimal solutions of the same type ; both give the same maximum/minimum values, then every point on the line segment ins these points gives the same optimal solution. 8 ILLUSTRATIVE EXAMPLES Example 1. Solve the following linear programming problem graphically : 60x + 15y subject to the constraints Maximize and minimize Z x+y <50,3x+y <9, x, y20. Solution, We draw the lines x + y = 50, 3x + y = 90 and shade the region satisfied by the given inequalities. The shaded region in the adjoining figure shows the feasible region determined by the given constraints. We observe that the feasible region OABC is convex polygon and bounded. So we use the corner point method to calculate the maximum and minimum value of Z. The coordinates of the corner points O, A, B, C are (0,0), (30,0), (20, 30) and (0, 50) respectively. We evaluate Z = 60x + 15y at each of these points. Comer point Value of objective function Z = 60x + 15y @o 0 Smallest (30, 0) 1800 — Largest (20, 30) 1650 (0,50) 750 Hence, the minimum value of Z is 0 at the point (0, 0) and maximum value of Z is 1800 at the point (30, 0). Example 2. Solve the following problem graphically : ‘Maximize Z = 5x + 2y subject to the constraints 3x + 5y < 15, 5x + 2y $10, x,y 20. Solution. We draw the lines 3x + 5y = 15 and 5x + 2y = 10, and shade the region satisfied by the given inequalities. The shaded region in the adjoining figure shows the feasible region determined by the given constraints. We observe that region OABC is a convex polygon and bounded, and has corner points 00,0), Ae, 0, B(2, 4) and cio, 9) (NCERN 19/19 Using comer point method, we see that at (0, 0), Z=0;at AQ, 0),2= 10; at B(Z, 5), z= 10; at eave id (0, 3), Z = 6. Thus, Z is maximum at both A and B — in fact all points on segment oe produce this maximum value of Z, Thus, we have multiple optimal solutions. Here the optimal value (10) is unigue, but there are an infinite number of opti” solutions. a Understanding ISC Mathematics-XII (11)te 3. Maximise Z = 8x + Sy subject to the constraints given below : “ ruSETPT SR SC OREN ah jon. We draw the lines 2x 4. 3y = 6, soem inequations. a shaded region in the adjoining figure shows the feasible region determined by the given constraints, solving 2° + 3Y = 6 and ax — 2y = 6 30 6 13 3x ~ 2y = 6, y = 1 and shade the region satisfied by the » simultaneously, we Br = 33, We observe that the region OABCD is a polygon, and bounded, and has comer points (0, 0), A(2, 0), 0 6 3 a2-8)-c(G. and D(O, 1) We evaluate Z = 8x * Sy at each of these comer points. Comer points Value of objective function = Bx + 9y 00, 0) Z=8.0+9.0 AQ, 0) Z=8.249.0=16 26 a8. 45 6 am °F) Bes Rag 5 =38.3 ig c(3.1) 2-83 91-01 DO, 1) Z=8.0+91=9 “Thus, Z has maximum value at B and maximum value 4 Find graphically, the mximum value of Z =2x + 5y, : Bees 6t + y.c4220,y20 subject to constraints given below: +yS4,x20,y20, = 4 (passes through (4, 0), (0, 2); es through (2, 0), (0, 6)) andThe optimal solution occurs at one of the comer points At O(0, 0), Z = 2.0 + 5.0 = 0; at AQ, 0), Z=2.2+5.0= 8 6 6 aa(s Ree +5.8=%, at C(O, 2), Z = 2.04+5.2= 10, Therefore, Z has maximum value at C and maximum value = 10, Exampl{3)Solee the following linear programming problem graphically Minimize Z = 3x + Sy subject to the constraints X+Y=6 x54 y<5,x2>0,y20. Solution. We draw the lines x + y = 6, we4y=5, Here the feasible region is the line segment AB, with corner points A(I, 5) and B(4, 2). At A(1, 5), Z=3.1+5.5 = 28 and at B(4, 2), Z = 3.4 + 5.2 = 22. Thus, Z has minimum value at B(4, 2) and the minimum value = 22. Example 6. Maximize Z = 2x + 3y subject to the constraints X+yS1, 2x +2y26,x20,y20. Solution. We draw the lines x + y=1 and 2x +2y = 6, and ‘observe that there is no common region satisfying the | given conditions. As there is no point (or set of points) satisfying the given conditions, the problem is infeasible ie. Z has | ‘no maximum value. Sty=l Example 7. The corner points of the feasible region determined by the following systems of linear ‘inequalities : ] x+y < 10, x + 3y < 15, x20, y>0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, when p, q > 0, then find the relation between p and q so that the maximum of Z occurs at both points (3, 4) and (0, 5). (NCERN Solution. The values of Z = px + qy at the points (3, 4) and (0, 5) are 3p + 4q and 5q respectively: As Z has maximum value at both points (3, 4) and (0, 5), we get 3p +4q = 54q => 3p =4 which : red relatio pand 4. ‘programming problem graphical I tothe constraints : x+y 2B, x 20. alities. a ae feasible determined by the sivesolving *+2y = 10 and x+y ~6 simultaneously, we get x=2andy=4 Solving ¥ + Y= 6 and 3x 4 y—g simultaneously, we get x =}, y— 5, We observe that the feasible unbounded and the corner A(10, 0), B, 4), C1, 5) and DO, 8), At the corner points, the values of Z are at A(10, 0), Z = 3.10 4.5.0 region is, Points are 30; at BQ, 4), Z=3.2 45.4 = 26, at C(1, 5), Z = 3.145.5 = 28; - at D(O, 8), Z = 3.0 + 5.8 = 40, The smallest value of Z is 26 at B(2, 4) As the feasible region is unbounded, we cannot say whether the minimum value exists or not, To check whether the smallest value 26 is minimum We draw the half plane 3x + 5y < 26 and notice that there is no common point with the feasible region. Hence, 26 is indeed the minimum value. Hence, the given objective function Z = 3x + 5y has minimum value 26 at BQ, 4). Example 9. Maximize Z = x + 2y subject to the constraints t-y20,2y smallest 6 > largest er largest value 6 is maximum : ae plane x + 2y > 6 and notice it has common points with feasible region. eee een Fate B62. Notice thatthe point 4.2) which Incest ee \ 8 ints in the dark shaded region yield values which are ds Z = 8 etc. In fact, all po regi = 5x + 10y subject to the constraints 2y20,x20,y20. (NCERT)repesatits of Z = Sx + 10y at the points A, B, C and D are 300, 600, 600 ang respectively. 400 Minimum value = 300 at A(60, 0), maximum value = 600 at B(120, 0) and C(60, 30) In fact, all points on the line segment BC give the same maximum value = 600, Example 11. A furniture trader deals in only tvo items— chairs and tables, He has &50\ space to store atmost 35 items. A chair costs him €1000 and a table costs him 2004 Profit of 8150 and 8250 on a chair and a table, respectively. Formulate the above pi maximise the profit and solve it graphically. 000 to invest andy 0. The trader earns, voblem as an L.pp ,, Solution. Let x be the number of chairs and y be the number of tables that the dealer buys and sels The profit on a chair is 8150 and the profit on a table is € 250. So, total profit P = 150x + 2504, Hence, the problem can be formulated as an L.PP. as follows: Maximise P = 150x + 250y subject to the constraints x+ys35 (storage constraint) 1000x + 2000y < 50000 je x+2y<50 (investment constraint) x20,y20 (non-negativity constraints) Draw the lines x + y = 35 and x + 2y = 50; shade the region satisfied by the given inequalities. The shaded portion show's the feasible region which is bounded. The point of intersection of the lines x + y = 35 and x +2y = 50 is B(20, 15). ‘The four comer points ofthe feasible region OABC are (0,0), A(35, 0), B(20, 15) and C(0, 25) At (0, 0), P= 150 x 0 + 250 x 0=0. AtA(35, 0), P= 150 x 35 + 250 x 0 = 5250, At B(20, 15), P = 150 x 20 + 250 x 15 = 6750. At C(0, 25), P= 150 x 0 + 250 x 25 = 6250. We find that P is maximum at B(20, 15) and maximum value of P = 6750. Hence, the dealer gets maximum profit of %6750 when he buys and sells 20 chairs and 15 tables. Example 12. A company manufactures two types of product A and B. Each unit of A requires 3 grams of tickle and 1 gram of chromium, while each unit of B requires 1 gram of nickle and 2 grams ofchromium. The firm can produce 9 grams of nickle and 8 grams of chromium. The profit is %40 on each unit of product Aand®50 on each unit of type B. How many unit of each type should the company manufacture 80.as to carn maximum profit? Use linear programming to find the solution. (Isc 2016) Solution. Let x and y be the number of products of types A and B respectively manufactured by the company. As the profit on each product of type A is 40 and on each product of type Bis €5, ‘$0 the total profit is Z = 40x + 50y (in ®). Hence, the problem can be formulated as are L.PP. as follows: Map Z = 40x + 50y subject to the constraints ea (nickle constrain‘) ( jum constraint) luct cannot be nega?)straight lines 3, draw the straight lines ax 4 y 9 equalities. Pare PAS) 6 phat shade the i region statisfied by the ‘ie shaded Portion shows the pounded feasible region which ig int of intersection of the tines rey = 8is BQ, 3), ahs SX 4. 49 and ts of the feasible ro Te BC, 3) and Cade see BION OABC are O19, AG, 0) B2, 3) and C(O, 4). The optimal solution cxrany \ grone of the comer points, occurs A000, 0), Z= 40x04 50x 029 ch. CAR 3a,.5 MAG, 0), Z= 40% 345002 139 ABQ, 3), Z= 40% 2450 x 3 = 259 AEC, 4), Z = 40 0450 x 4 = 209, at ea We find that the value of Z is m, ‘aximum at B(2, 3) Hence, the company should manufa icture 2 products of 3 ts of Bto get a maximum profit of 2230, Bee roa, Ove mand 2 prone of bie makes a profit of 80 on each piece of type A and ® 120 on each Piece of type B. How many pieces of type Aand type B should be manufactured er week to get a maximum profit? Make it as an LPP and solve ‘graphically. What is the maximum profit per week? (ISC 2018) Solution, Let x and y be the number of teaching aids of type A and type B respectively. As the profit on the type A of teaching aid is & 80 and on the type B is @ 120, so the total ‘Profit Z = 80x + 120y. Hence, the problem can be formulated as an LPP. as follows: Maximise Z = 80x + 120y 9x + 12y < 180 ie. 3x + dy < 60 8 +3y 530 (Finishing constraint) x20,y20 (Non-negative constraints) ‘straight lines 3x + 4y = 60, x + 3y = 30 and shade the region satisfied by the ities. - inequalit | region shows the feasible region which is bounded. The point of intersection Subject to the constraints (Fabricating constraint) is of the feasible region OABC are B(12, 6) and C(0, 10). The optimal ‘at one of the corer points. 80 x0 +120 x0=0 = 80 x 20 + 120 x 0 = 1600Example 14. A manufacturer has employed 5 skilled men and 10 se j-okilled men and makes two models A and B of an Hs The ne y ‘one item of model A requires 2 hours work by a skilled may, and 2 hours work by a semisklled man, One item of model B requires t hour by 4 skilled may and 3 hours by a semi-siled man, No nnen is expected (0 cork more liar 8 jes per day, The rmarufacturer’s projit on item of model A is © 15 and on an item of model B is € 10 How man items of each model should be made per day in order to ma daily profit? Formulate the above LPP and solve it graphically and find the maximum profil aximize Solution. Since each man skilled or semi-skilled works for atmost 8 hours per day and 5 skilled men and 10 semi-skilled men are employed, so the maximum number of skilled working hours * ailable = 5x8 =40 and maximum number of semi-skilled working hours ailable = 10 x 8 = 80. If x items of model A and y items of model B are made, then the PP is maximise Z = 15x + 10y subject to consti 2x + y < 40, 2x + 3y < 80,x20,y 20. We draw the straight lines 2x + y = 40 and 2x + 3y = 80 and shade the region satisfied by the above inequalities. The shaded region shows the feasible region which is the lines 2x + y = 40 and 2x + 3y = 80 is B(10, 20). i The comer points of the feasible OABC are O(0, 0), A(20, 0), B(10, 20) and C (0 5). te optimal solution occurs at one of the corner points. At O(0, 0), Z= 15x 0 +10 x 0=0; at A(20, 0), Z = 15 x 20 + 10 x 0 = 300; ‘at B(10, 20) Z = 15 x 10 + 10 x 20 = m7 OB 266" atc(o@),2=15x0+10%5 = 2665. bounded. The point of intersection of ‘We find that the value of Z is maximum at B(10, 20). ‘Hence, the manufacturer should produce 10 items of model A and 20 items of model B to ‘get maximum profit of 7350. Example 15. One kind of cake requires 300 g of flour and 15 g of fat, another kind of cake requires 150g offlour and 30 g of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 g of fat, assuming that there is no shortage of the other ingredients used in making the cakes. ‘Make it an LPP. and solve it graphically. Solution. Let x and y be the number of cakes of first kind and second kind respectively. The problem can be formulated as an LPP. as follows : Maximize _Z = x + y subject to the constraints 300x + 150 < 7500 (quantity of flour constraint) ie, d+ y < 50 _ 1S 30y < 600 (quantity of fat constraint) r isch x+2ys 40 (0, 50)) x 2 0, y 2 0 (non-negativity constraints) Draw the lines 2x + y = 50 and x + 2y = 40. Shade the region satisfied by the above inequalities. feasible region OABC is bounded and convex. corner points of the feasible region are O(0, 0), Mg B(20, 10) and C(0, 20). The values of Z atWefind that the maximum value of Z occurs at 8420, 19) ence, the maximum number of and maximum value = 39. cakes is 30 6 eon kind 1 out o { which 20 are of first kind and 10 of te 16. Ifa young man rides his motor cycle at 2. petrol fe rides ata faster speed of 40 km por hous £100 tospend on petrol and wishes to find the m jhisas a linear programming proble 5 knt per hour, he has to spend &2 per kilometre on the petrol cost increases to &5 per kilometre. He has raxinum distance he can travel within one hour. Express emt and then solve it graphically sation, Let x km and y km be the distances covers BAVeay aNd (40 Lan /¥ respectively d by the young man at the speeds of then time consumed in covering these distance are x ayy eee “ B hand 4g respectively. Total distance travelled by the young man D =x + y (kilometres). Hence, the problem can be formulated as an LPP. Maximize D= 2x + 5y v go < Lie. 8x +5y< 200 (time constraint) as follows x+y 100 subject to the constraints (money constraint) W w x2 0,y20 (non-negativity constraints) We draw the straight lines 2x + 5y = 100, x + 5y = 200 and shade the region satisfied by the above inequalities. The shaded portion shows the feasible region OABC which is bounded. The Point of intersection of the lines is B52, 2). The corner points of the feasible region OABC are 0(0, 0), A(25, 0), 3(2 2) ana cvo, 20. yo The optimal solution occurs at one of the corner Points. At 0(0, 0), D=0+0=0. At A(25, 0), D = 25 + 0 = 25. At 2.2) = 0,4 _ 39 33.4 s °3 = 20. At C(O, 20), D =0 + 20 2,8) We Gnd that the value of D is maximum at B(%, 2). 50 40 Fetes the young man covers a total distance of 30 km, “> km at 25 km/h and <> km at mee di BI sts 7360. 5 of cardigons : type A and type B. It costs 8360 to make TA company mate oe a gon, The compu in mak ams! 30 cards ¢ ‘cardigons of type B cannot exceed the number of st € 72000 a Boh, pues 18 Petes a profit of€ 100 for each cardigon of type pe A by more than 1m Formulate this problem as a linear programming problem every cardigon of a Solve it graphically and find maximum profit profit of the ve “and y cardigons of type B be manufactured per day by the of type = 100x + 50y- PP. as follows : subject to the constraints (investment constraint) Linear Programming —_/ 4373x+y < 300 (capacity constraint) ysx+ 200 (type B constraint) x20,y20 (non-negativity constraints) cegion satisfied by Draw the lines 3x + y = 600, x + y = 300 and y = x + 200 and shade ther the above inequalities. The shaded portion OABCD shows the feasible region, which is bounded. The comer points of the feasible region are O(0, 0), A (200, 0), B(150, 150), C(50, 250) and D(0, 200). The values of P at the comer points are at (0,0), P= 100x0 + 50x0 = 0; at A(200, 0), P= 100x200 + 50x0 = 20000; at B(150, 150), P= 100x150 + 50x 150 = 22500; at (50, 250), P= 10050 + 50x250 = 17500; at (0, 200), P-= 100x0 + 50x200 = 10000. We note that the value of P is maximum at the point B 222500 by manufacturing 150 cardigons of type A and 150 Hence, maximum profit = cardigons of type B. Example 18. An aeroplane can carry a maximum of 200 passengers. A profit of © 500 is made on each ecutive clas ticket out of which 20% will goto the welfare fund of the employees. Similarly a profit CF 400 is made on each economty class ticket out of which 25% will go for the improvement of facilities provided to economy class passengers. In both cases, the remaining profit goes to the airline's fund The rine eserves atleast 20 seats for executive class. However atleast four times as many passengers prefer to travel by economy class than by the executive class, Determine how many tickets of each type mus! be sold in order to maximise the net profit of the airline. Make the above as an L.P.P. and solve graphically. Solution. Let x be the number of executive class tickets sold and y be the number of economy class tickets sold, then total profit P (in %) = 500x + 400y. Hence, the problem can be formulated as an L-PP. as follows : Maximize P = 500x + 400y subject to the constraints x+y < 200 (capacity constraint) x2 20 (executive class constraint) yrar (economy class constraint) We draw the lines x + y = 200,x = 20 and sy, = 4x and shade the region satisfied by the above 2 The shaded portion shows the feasible region ABC which is bounded. The corner points of the feasible region ABC are A(20, 80), B(40, 160) and C(20, 180). ‘The optimal solution occurs at one of the comer points. ‘At A(20, 80), P = 500 x 20 + 400 x 80 = 42000; at B(40, 160), P = 500 x 40 + 400 x 160 = 84000 and. C(20, 180), P = 500 x 20 + 400 x 180= 82000. t the value of P is maximum at B(40, 160). profit of 84000 is earned by 20, 0,y20 (non-negativity constraints) + 2y = 12, x+y = shade the region satisfied by the n is the polygon ABCDE, which is of M and 4 items of N are produced, Linear Programming1 using two foods P and Q. Each packet (containing 30 g)offood P contains 12 units of calcium, 4 units of iron, 6 unite of cholesterol and 6 unit of tary ‘A. Each packet of the same quantity of food Q contains 3 unit ofealcium, 20 unite of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of eet atleast 460 units of iron and atmost 300 units of cholesterol. (i) How many packets of each food should be used t0 minimum amount of vitamin A? Example 23. A dietician has to develop a special « » minimize the amount of vitamin A? What is the (i) How many packets ofeach food should be used to maximize the amount of vitamin A in the dit? h (NCERT) What is the maximum amount of vitamin A? Solution. Let x packets of food P and y packets of f formulated as an L.PP. as follows Optimal function (units of vitamin A) Z = 6 12x + 3y 2240 (units of calcium constraint) food Q be mixed, then the problem can be x + 3y subject to the constraints ie, 4x+y2 80 4x +20 2460 (units of iron constraint) ie, x+5y2115 6x + 4y < 300 (units of cholesterol constraint) ie. 3x +2ys 150 x20,y20 (non-negativity constraints) Draw the line 4x + y = 80, x + 5y = 115 and 3x + 2y = 150, and shade the region satisfied by the above inequalities. The feasible region is ABC, which is convex and bounded. The corner points are A(15, 20), ‘B(40, 15) and C(2, 72). The values of Z (units of vitamin A) = 6x + 3y at the comer points are : at A(15, 20), Z x 15 +3 x 20 = 150; at B(40, 15), Z = 6 x 40 + 3 x 15 = 285; at C(2, 72), Z=6x2+3x 72 = 228. (@ Minimum units of vitamin A = 150, when 15 packets of food P and 20 packets of food Qare mixed. (i) Maximum units of vitamin A = 285, when 40 packets of food P and 15 packets of food Qare mixed. Example 24. The tailors A and B are paid €225 and %300 per day respectively. A can stitch 9 shirts and 6 pants while B can stitch 15 skirts and 6 pants per day. Form a linear programming problem ' minimize the labour cost to produce atleast 90 shirts and 48 pants. Solve the problem graphically. Solution. Let the tailor A work for x days and tailor B work for y days, then the total labour cost Z = 225x + 300y (in ®). ‘The problem can be formulated as an L.PP. as follows : | Minimize Z = 225x + 300y subject to the constraints 9x + 15y 2 90 ie, 3x + Sy 2 30ne rein sane antes) shown shaded in the given figure. The comer atthe comer points, the values of Z = 225x + a00y are at A(10, 0), Z = 225 « 10 + 300 x 0 = 2250, at BG, 3), Z = 225 x 5 + 300 x 3 = 2025, at (0, 8), Z thus, the values of Z (labour cost) at the comer points are £2250, £2025, 22400, ‘as the feasible region is unbounded, we draw the graph of the half-plane 225x + 300y < 2025 te ax + 4y < 27 and note that there is no point fommon with the feasible region, therefore, Z has ninimum value, Minimum value of Z is %2025 and it occurs at the point BG, 3), A(0, 0) Hence, the labour cost is minimum when A works for 5 days and B works for 3 days; and the minimum labour cost is & 2025. YN axe5y rryn8 ae dy = uample 25. A dict is to contain atleast 80 units of vitamin A and 100 units of minerals. Two foods F, and F, are available. Food F, costs €4 per unit and Fy cost %6 per unit. One unit of food F, ‘contains 3 units of vitamin A and 4 units of minerals. One unit of F, contains 6 units of vitamin ‘A and 3 units of minerals. Formulate this a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these two foods and also meets the minimal nutritional requirements. Solution. Let x units of food F, and y units of food F, be mixed and Z (in %) be the total cost of the food, then the poblem can be formulated as an L.PP. as follows = ‘Minimize Z = 4x + 6y _ subject to constraints 3x + 6y > 80 (vitamin A constraint) 4x + 3y > 100 (minerals constraint) x20y20 (non-negativity constraints) ‘Draw the lines 3x + 6y = 80 and 4x + 3y = 100, y ‘and shade the region satisfied by the above inequalities. ‘The feasible region (unbounded, convex) is shown TB + 6y = 108 ee a dotted in the given figure) and note that the h. +9 ee Be aie tutta region therefore, Z has maintnnen of Z is 104 and it occurs at the point B(24, 4). Linear ProgrammingHence, the minimum cost of the diet is 104 when we mix 24 units of food F, and © units of food Fy. Example 26. There are two types of fertilisers ‘A’ and ‘B’. ‘A’ consists of 12% nitrogen and 5% phosphoric acid whereas “B’ consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions {farmer finds that he needs atleast 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If A’ costs 10 per kg and ‘B' costs® 8 per kg, then graphically determine how much of each type of fertiliser should bbe used so that nutrient requirements are met at a minimum cost Solution. Let x kg of fertiliser A and y kg of fertiliser B be used and Z.(in ®) be the total cost of the two fertilisers, then Z = 10x + Sy. The problem can be formulated as an L.P.P. as follows ; Minimise Z = 10x + 8y subject to the constraints i ty > I2ie 3x +y 2300 (nitrogen constraint) zo +Sy > ie x+y2240 (phosphoric constraint) x20,y20 (non-negativity constraints) Draw the lines 3x + y = 300, x + y = 240 and shade the region satisfied by the above inequalities. The feasible region (unbounded, convex) is shown shaded. The corner points are A (240, 0), B(30, 210) and C(0, 300). The values of Z at the corner points are : at A(240, 0), Z = 10 x 240 + 0 = 2400; at B(30, 210), Z = 10 x 30 + 8 x 210 = 1980; at C(O, 300), Z = 8 x 300 + 0 = 2400. Among values of Z, the least value is 1980. We draw the line 10x + 8y = 1980 (shown dotted in the given figure) and note that the half plane 10x + 8y < 1980 has no common points with the feasible region, therefore, Z has minimum value. Minimum value of Z is 1980 and it occurs at the point B(30, 210). Hence, the minimum cost of the fertiliser is 71980 when he uses 30 kg of fertiliser A and > mix two kinds of food X and Y in such a way that the mixture contains 2 units of vitamin B and 8 units of vitamin C. The vitamin contents of LY costs & 36. Using linear programming, find the Tite oquted oltanins, prsranimn (sc 2019) xed and Z (in ®) be the total cost of the an L.PP. as follows: : subject to the constraints (vitamin A constrain’)w+ Wriiexrtys6 Bx ty 28 x20,y20 qo solve this LPP. graphically, we draw the lines x+2y=10 x+y=6 Bre ys8 comer points are A(10, 0), B(2, 4), The values of Z (in %) = at A(10, 0), 2 2(1, 5) and DO, 8). = 24 x 10 + 36 x 0 = 240; at BQ, 4), 2 = 24 x 2+ 36 x 4 = 192; at C(I, 4), Z = 24 x 1+ 36 x 5 = 204; at D(O, 8), Z = 24 x 0 + 36 x 8 = 288; ‘Among these values of Z, the minimum value is 192, We draw the line 24x + 36y = 192 ie. 2x + 3y = 16 (shown dotted) and note that the half plane 2x + 3y < 16 has no common point with the feasible region, therefore, Z has minimum value. Ya The minimum value of Z is 7 192 and it occurs at the point B(2, 4), Hence, the least cost of the mixture is 7 192 when the dietician mixes 2 kg of food X and 4 kg of food Y. Answer each ofthe following problems @) Write the constraints for the L.P.P. Find the coordinates of the points B and C. m. The equation of the line AD is >= are einen = ZY a tie x+2y=40. ont (0, 0) aiso the region x + 2y <40, therefore, the constrains LPP. are +50, x + 2y <40,x20,y20. fing 2x + y = 50 and x + 2y = 40 simultaneously, = 20, y= 10. ordinates of the point B are (20, 10). The es of Care (0,20), The feasible region (unbounded, convex) is shown shaded in the figure given bi 24x + 36y at the corner points are: points of the feasible region are O(0, 0), A(25, 0), B(20, 10) and C(o, 20). (vitamin B constraint) nC constraint) (vitami (Nor-negativity constraints) wi) Mii) Mii) low. The i OE ee 800.0) aA Nee 28. The feasible region for an L.PP. is shown in the adjoining figure: Find the maximum value of the objective function Z = 3x + 4y. = Lie. 2x+y=50. Linear Programming