LINEAR PROGRAMMING _ UNIT LPP Formulation and Graphical Solution . INTRODUCTION 13.2, ASSUMPTIONS OF LINEAR PROGRAMMING 13.3, STEPS FOR SOLVING LINEAR PROGRAMMING PROBLEM (LPP) 13.4. FORMULATION OF LPP 13.4.1. General Form of LPP 13.4.2. LPP in Summation Notation 13.4.3. LPP in Matrix Notation 13.4.4, Standard Linear Programming Problem 13.5. GRAPHICAL METHOD FOR SOLVING LPP 13.5.1. Maximization Cases 13.5.2, Minimization Cases 13.6. LINEAR PROGRAMMING PROBLEM: EXCEPTIONAL CASES 13.6.1. Multiple Optimal Solutions 13.6.2. Unbounded Solution 13.6.3. Infeasible Solutions 13.6.4. Redundant Constraints 137. APPLICATIONS IN BUSINESS EXERCISES ee ANSWERS se) OM13.2 BUSINESS wy Hea ~ I 43.1 INTRODUCTION Linear programming is a mathematical technique used for optimum alloca limited or scarce resources, such as labour, iste machine, money, energy on, to several competing activities such as products, services, jobs; ete, on the by of a given criteria of optimality. The term Tinea 8 proportionate reli of two or more variables in the model such tl a one en ef ange in on causes a proportionate change in another variable. The, 7 ‘programming from military organisation. It is used to specify a sort of planning that Involves 4 economic allocation of limited resources by adopting a particular course of action strategy from among various alternative strategies to achieve the desired objg Simply put, linear programming is a mathematical technique used for optim allocation of limited or scarce resources by choosing the best alternative from a of feasible solutions in a situation in which objective function as well as constrain can be expressed as linear mathematical relationships. A linear programming problg has following features: © Objective is clearly identifiable and it is measurable in quantitative terms, ‘« Decision variables are identifiable (for example, products included in the prod planning) and measurable in quantitative terms. © Variabj 3 « Resources allocated for achieving the tasks are identifiable and they are meastirabl quantitatively. + Relationships representing the objective as well as the resource limitations and constraints can be expressed as linear inequalities or equations. * A series of feasible alternative courses of actions are available to the decision m which are determined by the resource constraints. 13.2 ASSUMPTIONS OF LINEAR PROGRAMMING There are five important assumptions which are the pillars of linear programming model. (a) Proportionality: The proportionality indicates that there is a constant rate of. change in a variable. The presence of proportionality is a basic assumption of linear programming models in the objective function and in the inequalities that represent the constraints. « In the context of objective function, if one unit of a product (with quantity denoted as x units) contributes $25 towards sales, then the total contribution would be equal to 25x, For 2 units, it would be equal to %50 and for 4 units it would be 7100. * Similarly, if the production of one unit requires 3 machine hours, then thi production of 10 units would require 30 hours, 20 units would require 60 bot and so on. * In the economic sense, proportionality implies constant returns to scale, whi is devoid of any economies of scale. ‘The objective function for a Linear Programming Problem must be a linear ft of the decision variables. It has two implications: ke * The contribution in the objective function from each decision variable proportional to the value of the decision variable. * The contribution to the objective function for any variable is independent of other decision variables._ 138 yaTiOn AND GRAPHICAL SOLUTION aMule —— tivity’ | This assumption refers to ability of one variable representing 9” aaitivltY" added to another variable representing another activity. In lineat sad bei her pire M . ddition of ctv ming model, the objective function is constituted by a simple a! poeramrion by each of activities. Likewise, the inequalities, which represent the contr ints, are formed as the aggregate of each activity conducted separately. cons stance, the total profit in the objective function is determined by the sum ns rofit contributed by each of the products separately. Similarly, the total ofthe Plog a resource used is equal to the sum of the resource values used by argu activities. ortionality and additivity taken together imply that every linear programming paint must be a linear inequality (or linear equation). As a result, const bution of each Variable to the left-hand side of each constraint is proportional * auine value of the variable. . contribution of a variable to the left-hand side of each constraint is independent ithe values of the variable. uity (or Divisibility): This assumption of a linear programming model Contin Be ae : isi (corres that the decision variables are divisible and continuous, and each decision inpile is permitted to assume fractional values. As a result, the outputs, in the context of product problems, may turn out to be fractional values. For example, : 3. the optimized solution to a problem may suggest that 7 me units of product X and az units of product Y need to be produced per day. If the decision variables are not infinitely divisible, the problem situation is to be handled by integer programming instead of linear programming. (@ Certainty: Further it is assumed that the components of a linear programming model namely, the objective function coefficients, the coefficients of the inequality (or equality) and the. constraint values are known with certainty. For example, the contribution per unit of a decision variable to the objective function, the rate of consumption of material and labour to produce a unit of output as well as the available resources for production are known with certainty. As a result, linear Programming is deterministic rather than probabilistic in character. ” (©) Finite Choices: Finally, it is assumed that a decision maker has a finite number of choices in the context of a linear programming model. Moreover, it is assumed that the decision variables cannot have negative values. The feasible solution does not consist of any negative value. This assumption is important and realistic Petause in the context of production and marketing, the units produced and sold, ting physical quantities, have to be positive. t 83 STEPS FOR SOLVING LINEAR PROGRAMMING PROBLEM (LPP) Formulation of the problem: i Identity the decision variables whose values have to be determined. tin uae the objective function as a linear function of decision variables, — the limitations on the resources as linear equations or inequalities in 0) tn = of the decision variables. ; _ the tude non-negativity restriction. It is assumed in linear programming that lecision variables cannot have negative values. ~~13.4 BUSINESS MATHEMATIC, 2. Find the basic solution of problem. 5 ; 4 Compute the set of values of decision variables that satisfy the constraints, Th, are two methods of solving LPP, viz., graphical method and simplex meth 3. Identify the feasible solution. Feasible solution values are those values from amongst the set of basic solutio which also satisfy the non-negativity restrictions. 4, Ascertain the optimal solution. The optimal solution is the values chosen from the set of feasible solutions th, optimize the objective function. Generally, an LPP has a unique optimal soluti that satisfies all the constraints while optimising the objective function. Howeve there are some exceptional cases where the optimal solution is not unique (multip optimal solutions), there is no solution (infeasibility), the solution space is unbound, or all the constraints do not bind the feasible solution (redundancy). These speci cases can be duly identified using both the graphical and the simplex method, 13.4 FORMULATION OF LPP First and foremost, step in solving a linear programming problem is its formulatio: It refers to the translation of a real-world situation into a format of mathematic equations and inequalities that represent the objective function and the constraint set. Formulation of LPP as a mathematical model involves the following steps: 1, Identify the decision variables and assign them symbols such as x, y, z, .. X,, Xq, % .~.. Decision variables are the quantities that have to be determined. Fi example, to determine the amount to be invested in three available investmen alternatives, x, y and z are assumed to be the respective decision variables. 2, Formulate the objective function. The objective function has to be identifi and expressed in terms of the decision variables. For example, the objective be to maximize return from the investment. If the percentage return from eadl available investment alternative is 10%, 8% and 9% from alternatives X, Y an Z respectively, then the objective function can be formulated as Maximize Z = 0.1x + 0.08y + 0.092. Thus, the objective function is to maximize the total return from investment it the available alternatives. 3. Identify and formulate the constraints. The set of constraints has to | identified and expressed as inequalities or equations in terms of the decisi variables. For example, if total funds available to be invested are %5,00,000 the the constraint can be stated as x + y + z < 500000. 4, Add non-negativity restriction. Though a trivial step, but one should not forget writing the non-negativity constraints. It ensures that the decision variabl cannot assume negative values. 13.4.1 General Form of LPP Let x1, %2) 3, «++» %,) be decision or choice variables, ¢j(c1, Cg, C3, --» Cn) be the or profit coefficients (contribution to the objective function), a,(i = 1 to n, j = 1 t be the exchange coefficients and b,(b,, bo, bs, ..., by,) be the resource values. According! there are n number of decision variables and m number of constraints. In genet form, a linear programming problem can be mathematically stated as follows.RAPHICAL SOLUTION 7 LATION AND G' I ee 135 £2 ul ,onjecti optimize ( ve function Maximize or Minimize) Z = cx, + cox, + cyty + ou. + Cg2y 4, constraints guibject t0 constraints (structural or resource constraints): ayy + Ay2%2 + Ayg%q + + Ginky [S, Ayyty + Agp%Xp + Aggy +... + Dany [S, yx, + Agg%y + AggXy +... + agar, [<, AyyXy + Amatty + AmgXy + on. + AmpXy [S, 3, Non-negativity restriction Xyy Koy X gy over Xp ZO 434.2 LPP in Summation Notation ‘the linear programming problem stated above can be expressed in summation notation 6 Optimize 2 = i Gx; ia Subject to constraints: Las [s = 2])s (f=1, 2, ..., m) x; 20; (j 1843 LPP in Matrix Notation I S = . ‘ "matrix notation the linear programming problem can be written as: | Ontimize Z = OX | Sibject to constraints: AX [s, =, 2] B X20 “here, Cc | “'8the CostProfit Coefficient Matrix, C = [ey €3) = €a Xi | “She Decision Variables Matrix, X = |"? | A13.6 BUSINESS MATHEW EAT M1 Oy a, , . yy. A is the Technological (or exchange) Coefficient Matrix, A=]! 07°" Gan Gm Ima yy a by Value Matrix, B = B is the Resource (availability! requirement) 13.4.4 Standard Linear Programming Problem ‘A standard linear programming problem involves maximization of objective func subject to all < constraints and non-negativity restrictions. It takes the form: 1. Objective function: Maximize Z = ¢y% + ¢2%2 2. Constraints: Subject to constraints: 41%, + GyQ% + G9%3 + + + Finn constraints ‘Any non-standard LPP say, d sign can be converted into the standard form. or variables with unrestricte Example 13.1 A person wants to invest up to an amount of %50,000 in fixed income securities. His broker recommends investing in two bonds; Bond A yielding 8% and Bond B yielding 12%. After some consideration, he decides to invest at most %25,000 in Bond B and at least %18,000 in Bond A. He also wants the amount invested in Bond A to be at least equal to the amount invested in Bond B. What should the broker recommend if the investor wants to maximize his return on investment? Formulate this situation as a linear programming problem. Solution: (i Identification of the decision variables: ‘The given problem seeks to identify the amount to be invested in two types o bonds. Let x, and x, be the decision variables which represent the amount t0 be invested in bonds A and B respectively. (ii) Formulate the objective function. The objective of the given problem is to maximize the return. Therefore, objective function can be expressed as: Maximize Z = 0.08%, + 0.12x., where Z refers to total return from the bonds. theJON AND GRAPHICAL SOLUTION 13.7 pMULAT! 5 5 , imized roe ne constraints subject to which the objective function has to be optimized. sae total amount to be invested can be (ny The 'p to 50,000; mathematically, it plies that x; + x, < 50000 imi Investment in Bond B can be at most %25,000; it implies x, < 25000 Investment in Bond A should be at least €18,000; it implies 2, > 18000 Investment in Bond A should be at le houlk ‘ast equal to the amount invested in Bond B, implies that x, is either equal to or greater than x, ie, x2% 2 %-m 50 2 3 4 Non-negativity restriction: Amount invested is expenditure and not borrowing, (® jrerefore the value of x, and x, should be Positive; x1, x > 0. sulation: Upon collating the above mathematical expressions, i a Z = 0.08%, + 0.12x» ect to the constraints: the LPP is expressed as: ‘subj x, + x2 < 50000 XS 25000 *, 2 18000 %y- x50 Xy > 0. Fumple 13.2, A manufacturer produces two types of products X and Y. The pyiation of X requires 8 hours of grinding and 4 hours of polishing; whereng thee and 5 hours of polishing. The manuf: facturer has grinder works for 40 hours a week and each polisher Solution: ) Identify the decision variables. % and x, be the units of product X and Y respectively. " Define the objective function. The total profit from the two products is 36x, + 45x; the objective function is Biven by Maximize Z = 36x, + 45x, Where Z represents total profit. / “® State the constraints subject to which the objective function should be masini. 1: The grinding hours required by both the products can be mathematically put 48 8x, + 2x.. Since total grinding hours available are 4 therefore the constraint is given by 8x, + 2x, < 160. Sa 2. The polishing hours required by both the products are 42, pian sie Polishing hours available are 2 x 90 = 180 hours, therefo is 4x, + Bx, < 180. i PianF< ‘oe BUSINESS MATHEMATICg (iv) Non-negativity restriction: Being physical quantities, the number of units of products cannot be negati therefore, x,, x 2 0. Formulation: Upon collating the objective function and constraints, LPP is formulated Maximize Z = 36x, + 45x, Subject to the constraints: Bx, + 2x, < 160 4x, + Bx, < 180 Xp, ty 20. Example 13.3. A firm is engaged in producing two products A and B. Each unit product A requires 3 kg of raw material and 2 labour hours for processing, wherea each unit of B requires 2 kg of raw materials and 3 labour hours for the same typ Every day, the firm has an availability of 60 kg of raw material and 96 labour hour; One unit of product A, when sold yields ¥50 and one unit of product B, when sol yields 40 as profit. Formulate this as a linear programming problem to determine number of units of each product that should be produced per day so as to maximiz profits. Do not solve it. Solution: (i Identify the decision variables. Let x, and x, be the number of units of produ A and B respectively. (ii) Define the objective function. The total profit from both the products is 50x, + 4 the objective function is Maximize Z = 50x, + 40x, where Z refers to the total profit. (iii) State the constraints subject to which the objective function should be maximize‘ 1. The raw material required by both the products is 3x, + 2x,, the availability of total material is 60 kg, therefore raw material availability constraint i given by 3x, + 2x, < 60. 2. The labour hours required by both the products are 2x, + 3x, and total labo hours available are 96 hours. Therefore labour availability constraint i given by 2x; + 3x, < 96. (iv) Non-negativity restriction: Being physical quantities, the number of units of the products cannot be negative therefore x1, x) > 0. Formulation: Upon collating the objective function and constraints, LPP is formulated a: Maximize Z = 50x, + 40x, Subject ta the constraints: Bary + 2xy < 60 2x, + 8x, < 96 xy > 0.13.9 “4. An electronics company produces three types of spare parts for wgrines. The company buys castings of the spare parts from a local foundry j{mishes the spare part on drilling, shaping and polishing machines. The parts A, Bu, Parts A, B, and C respectively are 16, 720 and %28. Castings for of each type nd © respectively cost £10, 212 and £20. The shop possesses only one drilling, Pd i machine. Cost. per hour to run each of the three machines is €40 for hour for each pane @Ping and %60 for polishing. The capacities in terms of parts per ach Part. processed on each machine are shown in the following tabl sewing m, -—______ Capacity (per hour) Machine + see ¥ a Drilling x a ri Shaping 25 20 20 Polishing 7 a a3 The management of the company wants to know how many parts of each type it should produce per h ‘our in order to maximize profit for an hour's run. Formulate this problem as an LP model SO as to maximize total profit to the company. Do not solve it. Solution: @ Identify the decision variables, Let x;, x, and 3 be the number of Spare parts of types A, B and-C produced per hour respectively. (i) Define the objective function, Given the information about the selling price, cost of buying and processing, the Profits from each type of spare part can be estimated a: 30 Profit per unit of type A spare part = (16 - 10) — (42, 89, 60) _ 4.5 25 25 40 40 60, 60 Profit per unit of type B spare part = (20 12) (35 Sts] = 2.00 40 60, 60 Profit per unit of type C spare part = (28 — 20) — z'n*a) = 1.90 Thus, the total profit from these spare parts is 0.5%; + 2x5 + 1.9x5, the objective function is given by Maximize Z = 0.5x, + 2ry + 1.9%, Where % refers to the total profit. "State the constraints subject to which the objective function should be maximized. The proportion of time allocated among three spare parts cannot exceed 1 therefore wd constraints can be stated as: a . XX 1: Drilling machine constraint: (2+4+2) * ; Fi MMe, X38 ®. Shaping machine constraint: (2-2-3) s1 (B+ Xe +2) <1 3. Poliens ; Polishing machine constraint: ~ 25000 2. Medium-Grade Oil: The production is 30x, + 300x, + 600xs against © for 27,000 barrels, 1 80x, + 300x, + 600x, > 27000 A 3. Low-Grade Oil: The production is 200x, + 500x, + 400x, against orders & 30,000 barrels, +. 200%; + 500x2 + 40x; > 30000LPP FORMULATION AND GRAPHICAL SOLUTION 13 (®) Non-negativity restriction: Since the number of days are positive numbers o Xy yy 3 > 0, Formulation: Upon collating the objective function and constraints, LPP is formulated as: Minimize Z = 20000; + 250002, + 30000. Subject to the constraints: 400%; + 300x, + 4002, > 25000 (High-grade oil) 300%; + 800%, + 600x, > 27000 (Medium-grade oil) 200%; + 500%, + 400%, > 30000 (Low-grade oil) Hy By > 0. Example 156. | ADPL Power Company wishes to schedule its work force for the coming month. Its employees work in 8-hours shifts beginning at 6 a.m., 10 a.m., 2pm. 6 p.m. and 10 p.m. All but the late shift (10 p.m. to 6 a.m.) overlap the next shift by 4 hours. The following table shows the number of workers that ell be needed during the shifts. : Hours Workers Required 10 p.m. ~ 6 a.m. 7 6 am. ~ 10 am. 15 10 a.m, — 2 p.m. 23 2pm. ~ 6 p.m. 17 6 p.m. ~ 10 p.m. 5 f How many workers should be scheduled to report for each of the five shifts if the cmpany wishes to minimize its total work force? Formulate this problem as LP problem. Do not solve it. Solution: (i) Identify the decision variables. Let x,, x9, Xs x4 and x; be the number of workers that are scheduled to'report during the shifts beginning at 6 a.m., 10 a.m., 2 p.m., 6pm, and 10 p.m. respectively. {i) Define the objective function. The company wishes to minimize its total work force denoted by Z, therefore the objective function is Minimize Z = Xt Xp + xy + xy t 45. "State the constraints subject to which the objective function should be minimized. 1. m number of employees report in the beginning of 6 a.m. — 10 a.m. shift and Continue till the end of the 10 a.m. - 2 p.m. shift. The 6 a.m. - 10 am. shift is the first shift requiring 15 employees and there is no overlapping of workers from the previous shift. Therefore, the constraint is x, = 15, * % humber of employees report in the beginning of 10 a.m. - 2 p.m. shift and Continue till the end of 2 p.m. - 6 p.m. shift. The 10 a.m. ~2 p.m. shift requires SpPayees and it also has employes frm the previous eit (ie, erefore total number of workers available will be x + x, which shoul Collectively meet the requirement. Therefore, the constraint-is x + x, > 23. aery >, / 13.12 BUSINESS, MATHEMat) 3. xg number of employees report in the beginning of 2 p.m. — 6 p.m, nin fa continue till the end of the 6 p.m. — 10 p.m. shift. The 2 p.m. — Spat ang requires 17 employees and it also has employees from previous shift (ryt therefore total number of workers available will be x + x, which 4"? collectively meet the requirement. Therefore, the constraint is x, +4) ™ld 2, number of employees report in the beginning of the 6 p.m. —10 pm j ‘and continue till 2 a.m. The 6 p.m. — 10 p.m. shift requires 5 emplojn en it also has employees from previous shift (i.e., x3), therefore t of workers available will be x, + x, which should collectiv requirement. Therefore, the constraint is x, + x, > 5. 5. x, number of employees report in the beginning of the 10 p.m. - 6 am, ship and work for 8 hours till the end of the same shift. The 10 p.m. — 6 shift requires 7 employees and it is a non-overlapping shift. Therefore 9. must exactly meet the requirement of employees. The constraint can’ se stated as x, = 7. = Ployees and otal number ely meet the (iv) Non-negativity restriction: The number of workers has to be positive therefore Xr Xap Xpy yy Xp 20 Formulation: Upon collating the objective function and constraints, LPP is formulated as: Minimize Z = x, + xy + x5 + x4 + % Subject to the constraints: 15 x, + x 223 m x, + x3217 Xy, Xp Xqy Xqy Xs 2 0. Example 13.7. The resident doctors in a hospital work for five consecutive days and have two consecutive days off. Their five days of work can start on any day of the week and the schedule rotates indefinitely. The hospital requires the following minimum number of doctors working: Mon Tue Wed Thurs Fri Sat 102 73 58. 45 70 96 number of doctors Formulate a general linear programming model to minimize the employed by the hospital. Solution: (i Identify the decision variables. Let x1, x, %) ty 5) X) and % wd resident doctors scheduled to report on Monday, Tuesday, Wednesday, Thu Friday, Saturday and Sunday respectively. ea (ii) Define the objective function. Let Z denote the total number of resident that the hospital wishes to minimize, therefore the objective functio! be the number of Minimize Z = x, + x, + x3 + 24 + %5 +X + X7on LPP FORMULATION AND Gp (if) State the constra 1. & is the s the n Besides, thos and Sunday ism tat y, » Besides, tho, 13.13 -APHICAL SOLUTION ‘ints subject to which the objective function should be optimized. mber of doctors start their 5-days work schedule on se who started their 5-days work on Thursday, Fri will also be working on Monday, therefore the require . + x6 + x, > 102. is tl Nira eral Besides RUMber of doctors, who start their 5-days work schedule on Tuesday. se who started their 5-days work on Friday, Saturday, Sunday Monday. Friday, Saturday d constraint and : : Monday will also be working on Tuesday. Therefore, the required constraint is x, + Xs + xg + x, + x, > 73. 7 Say, when is the number of doctors, who start their 5-days work When x, (2 Wednesday, the required constraint is x3 + 5 + 7 + %1 + X22 58. Thursd, ‘4 is the number of doctors, who start their 5-days work schedule on ursday, the required constraint is x4 + x7 + 2, + x; + Xs = 45. When 2, is the number of doctors, who start their 5-days work schedule on Friday, the required constraint is x, + x, + x + x + x, > 70. When x, is the number of doctors, who start thei constraint is xg + x, + x, ir 5-days work schedule on Saturday, the required + x4 + xs > 96. When x; is the number of doctors, who start their 5-days work schedule on Sunday, the required constraint is + Ky + Xq + x5 + xg > 40. (iv) Non-negativity restriction: The number of doctors will be positive therefore the non-negativity restriction is x, x2, x3, Xp Xp. Xe X7 20. Formulation: Upon collating the objective function and constraints, LPP is formulated as: Minimize Z = x, + xp + xg + x4 + x5 + x5 + x7 Subject to the constraints: x, + x4 + x5 + x6 + xy x + xy + x5 + x6 + x, X + xy + xy + xg t+ x7 x + xy + x3 + x4 + xy x, +X + xy + xy + Xs Xp + x3 + x4 + x5 + Xo Xg + xy + x5 + Xe + 7 Xy, Xa, Xgy Xay Xp» Xe» 2X7 ‘An investor has short listed the investment alternatives given in the Example 13.8. 102 aeRaA SSaaS vVvWVVVViviv onD $ ‘illowing table. The return on investment is expressed as an annual rate of return the invested capital, The risk estimate is made by the investor on a scale from 0 °° 10. The term of investment in the average length of time required to realise the “turn on investment is indicated in the following table: Investment Alternative Yearly Return on | Risk Term of Investment (%) Investment (yrs.) ak = > uuity Linked Saving Scheme 18 2 4 ~Lublic Provident Fund g. : 18 peta 13 1 2 Sook Options 22. # 8 Keg 0 0 0 My13.44 BUSINESS MATHEYy, cs, The investor wants to maximize the return on his investment. The selecting the portfolio are: (1) the average risk should not exceed 3.5, ( term of investment should not exceed five years, and (3) at least the funds should be retained in the form of cash. Formulate the ab programming problem. Buidelines fo, 2) the average 10 per cent of ove as a linear Solution: (i) Identify the decision variables. Let x1, x2, Xj, 4 and x; be the proportion ; I of funds invested in the investment alternatives 1, 2, 3, 4 and 5 respectively, (ii) Define the objective function, The investor wishes to maximize the tot (ie., Z) on his investment, therefore the objective function is Maximize Z = 18x, + 9x, + 13x, + 22x,. al return (iii) State the constraints subject to which the objective function should be optimized, 1, The total proportion of funds should be equal to 1, i.e., the sum of proportionate investment in various alternatives. Therefore, x, + x + Xy t xy 2. The average risk should not exceed 3.5. ~ the risk constraint can be stated as 2x, + x, + 3 + 4x, < 3.5. 3. The average term of investment should not exceed five years. -. term of investment constraint is 4x, + 15x, + 2x, + 3x, < 5. 4. The constraint that at least 10 per cent of the funds should be retained in the form of cash can be stated as x, > 10%. +x5=1, (iv) Non-negativity restriction: Investment has to be positive. J+ Bay Kay Hy Ky Xp > 0. Formulation: Upon collating the objective function and constraints, LPP is formulated as: Maximize Z = 18x, + 9x, + 18x, + 22x, Subject to constraints: xy + xy + xy t xy t xg = 1 2x, + xy + xy ¥ 4x, < 3.5 day + 16x, + 2x, + Bxy <5 X5 > 0.10 Xyy Xap Nyy Xq, 5 > 0. Example 13.9. Shyam, an agriculturist has a farm with 125 acres. He produces radish, peas and potato. Whatever he raises is fully sold in the market. He gets €5 for radish per kg, €4 for peas per kg and %5 for potato per kg The average yield is 1500 kg of radish per acre, 1800 kg of peas per acre and 1200 kg of potato per acre. To produce 100 kg of radish and peas each and to produce 80 kg of potato, a sum of 12.50 has to be used for manure. Labour required for each acre to raise the crop is 6 man-days for radish and potato each and 5-man days for peas, A total of 500 man-days of labour at a rate of 740 per man-day are available. Formulate this linea! programming model to maximize the agriculturist’s total profit, (Delhi Univ., B.Com. Hons., 200!)oRMULATION AND GRAPHICAL SOLUTION 13.15 rl ek ion! soi remify the decision’ variables, ‘The given problem focuses on maximization of OMe Agriculturist’s total profit and the information given in the problem states revenue and costs per acre of crop, Let us assume x, x, and x, represent the grea under cultivation of radish, peas and potato respectively in acres. ) Define the objective function. The objective of the given problem is to maximize "” the total profit which can be computed as Revenue — Cost per acre of the crops. Revenue from a crop per acre can be computed as ——Total Produce pig. Area under cultivation sch = 15002, Revenue per acre of radish = 3X5 = 87500 1 Revenue per acre of peas = 1800%2 4 _ z 7999 Xs Revenue per acre of potato = 1200%3 5 _ xgogo, I = Cost of planting a crop can be computed as: (a) Cost of manure per acre = Total yield (in kg) x Cost per kg Cost of manure per acre of radish = 1500x22:50 = 2187.50, Too 87.51 12.50 Cost of manure per acre of peas = 1800x 700 225, 12.50 Cost of manure per acre of potato = 1200x = 7187.50 (6) Labour cost per acre = Man-days required x cost per man-day Labour cost per acre of radish = 6 x 40 = 240 Labour cost per acre of peas = 5 x 40 = 7200 Labour cost per acre of potato = 6 x 40 = 7240 Net profit per acre = Revenue — Cost of manure — Cost of labour Net profit per acre of radish = 7500 — 187.50 — 240 = %7072.50 Net profit per acre of peas = 7200 — 225 — 200 = %6775 Net profit per acre of potato = 6000 — 187.50 — 240 = %5572.50 Therefore, the objective function can be stated as Maximize Z = 7072.5x, + 6775x3 + 5572.5x, \") The above objective function is subjected to area constraint and labour constraint, (@) 6x, + 5x, + 6x < 500 (Man-days constraint) (0) x, + xy + x5 < 125 (Area constraint) (ivy Non-negativity restrictio therefore x,, x9, 24 > 0. : The area under cultivation will have positive value, “mulation: Upon collating the objective function and constraints, LPP is formulated as: @ximize Z = 1072.5x, + 6775x_ + 5572.5x5 ba .oe BUSINESS Mar} 13.16 SS MATHEY A i —HEMATIC Subject to the constraints: xy + Xp + xy < 125 6x, + 5x, + 6x, < 500 yy Xyy %y > 0. (Area constrains (Man-days constraint) Example 13.10, A manufacturer produces three models of trekking bicycles. ra Model Model B and Model C whose selling price per unit is 76000, 27000, and 710000 respectively. The cost of the frame for Model A, Model B and Model C is 2000, gaye and %6000 respectively. The capacity (bicycles per hour) of assembling, Painting ang packaging each model is as follows: Machine Capacity per hour | Process Model A Model B Model © Assembling 30 25 Painting 20 25 25 Packaging 50 50 25 The manufacturer possesses only one of each type of machine. Cost per hour to run cach of the three machines is €1500 for assembling, 2000 for painting and 22500 for packaging. Formulate LPP to maximize profit. Do not solve. Solution: © Tdentify the decision variables. Let x,, x, and x, represent the number of trekking bicycles of Model A, Model B and Model C respectively. (ii) Define the objective function. The objective of the given problem is to maximize the total profit which can be computed as Revenue — Cost per bicycle of each model. Model A @)| Model B @)| Model C ® Selling Price (a) 6000 7000 10000 | Cost q (i) Frame 3000 4000 6000 (i) Assembling 3 : f = Cost per hr. of run x time in hre, per unit ssoo(55) vseo(5) ssen(35) thr. Q a ee = 50 = 60 = 50 Cpe ees eae in no, of al ii) Painting = Cost per hr. of run(—!—]} 2000(2.| | 2000{ aon} (i Painting = Cost per he. of run = a % = = 100 = 80 = 80 i i 3 2500(2.) | 2500(2.} | 2500 =) (i) Packaging = Cost per br. ofrun| as a = 7 = 50 = 50 = 100 Total Cost (b) 3200 4190 6230 Profit = (a) - (b) 2800 2810 8770— LPP EORMULATION AND GRAPHICAL SOLUTION qherefore, the objective function j - ° is Maximize Z = 2800x, 13.17 * 2810x, + 3770x, ji) The capacity ; (ii) Y constraint of the three machines are as follows: 1 1 1 om+ty yl 30 2+ 2x4 <1 25°* "3078 (Assembling constraint) 1 1 2 outtned 2 +53 X3S 20°1 25°? * 95% $1 (Painting constraint) 1 1 3 oytont+ly 501 50°? 5% 51 (Packaging constraint) (iv) Non-negativity restriction: x, Xyy X53 > 0. + Xa, X20. Formulation: Upon collating the objective function and constraints, LPP is formulated as. Maximize Z = 2800x, + 2810x, + 3770x, subject to the constraints: 1 1 1 . 30 ay + 252 + 3078 s1 (Assembling constraint) 1 1 1 pont apt tag 1 (Painting constraint) 1 1 1 ; al x +55 Hy + x3 S1 (Packaging constraint) X, Xp, Xy 20 ot Mutual Fund has %24 lakhs available for investment Example 13.11. The Sure-sh ble. The annual expected return and risk factors alternatives given in the following tal are given below: ‘Annual Expected Return (%) | Risk Factor (0 to 100) Type of Investment Government Bonds 2 7 Blue Chip Stocks 4 is Speculative Stocks 4 : 10 Short-term Deposits i term deposits and not to Jeast &3 lakhs in short of ‘36 Gpeculative stocks must be at most 20 per cent of 96 eifual fund wants to invest the funds so as to ‘nulate this problem as an LPP. 1 return. For (Delhi Univ., B.Com, Hons., 2015) Ee Fund is required to kee t rite an average risk factor © total amount invested. *timize its total expected annual ount of funds (in lakhs) to be Solution: mi be the Stocks and Short-term ig : i iygil08 Variables: Let ty 2 48 ae Stocks, Speculative Yenoaice 2 Government Bonds, Blue Chip its respectively. _oe 43.18 BUSINESS MATHEMATiog Objective function: Let 2 be the total expected annual return to be maximized by th mutual fund, therefore objective function is Maximize Z = 0.12x, + 0.18%, + 0.24x3 + 0.10x, Constraints subject to which the objective function should be optimized: 1. Total amount of funds available for investment is $24 lakhs. 2X, + ty tty ty S24 2. At least &3 lakhs to be invested in short-term deposits, therefore x, > 3, 3. The average risk factor should not exceed 36. 10x, + 25x, + 48x, + 6x, < 36 4, At most 20% of total amount is to be invested in speculative stocks xg S$ 0.20(x, + x» + x5 + x4) Non-negativity restrictions: Investment cannot be negative; therefore, x,, ay yy X4>0 Formulation: Maximize Z = 0.12x, + 0.181, + 0.24x5 + 0.10x4 Subject to constraints: xy +X, + xy ty > 24 4428 10x, + 25x» + 48x5 + Oxy < 36 xy $0.20 (x; + xy + xy + 24) and non-negativity restrictions Xp Hoy Xyy Xq > 0. 13.5 GRAPHICAL METHOD FOR SOLVING LPP After formulation, a linear programming problem can be solved by graphical or simplex method. Though graphical method is easier than simplex method, it is applicable to two variables problems only. It involves the following steps: 1. Plot the constraints. Draw the graph of constraints treating inequalities as equations. The constraint lines represent the availability of the resources or the structural constraints. The constraints are plotted by connecting the horizontal and vertical intercepts calculated from the constraints expressed as equations. 2, Identify the feasible region of each constraint. Feasible region is the area containing feasible solutions with respect to each constraint. The simplest way is to put the coordinates of origin, i.e., (0, 0) in a constraint and check whether it satisfies the constraint inequality or not. If it does, then that side of the constraint line containing the origin is the feasible area for that particular constraint. °3. Identify the common feasible region. ‘The common area determined by all the constraints as well as the non-negativity restrictions is called the common feasible region or solution région for the problem.13.19 space or unbounded on as well as lying ¢ coRMULATION AND GRAPHICAL SOLUTION ee ae reel a region may be a polygo1 Hi feasible 4 \ polygon, a line se; ne the points contained within the eet See re poundary represent the feasible solutions. asible rest ” ; ' a ind the optimal feasible solution. 42m |. in the feasible regi i wy point oN eal olution. Ak that gives the optimal value of the objective function led 2° OPP, feaeeNeel ccording to the extreme point theorem, “an optimun! tion to ca " ae optiiael rire of Hi extreme points of the feasible regio! F ytion : n can be obtaii on in Post metho fl obtained either by corner method oF 5 corner Point Method Locate the corner Pe or the extreme points which exist at the intersection of ting the constraints. Optimal solution always lies at the extreme they are the vertices of the common feasible region. two lines represe or corner points. nd select the maximum or ectively. This ate the objective function at each corner point a ue for a maximization or minimization problem resp 1 solution for the given LPP. Bvalui ninimum val js the optimal rofit/Iso-cost Method nt values of the objective function falling in # function lines to determine the direction for improvement. wn, then improvement is in the direction of lesser value for a e corner points, draw nt which (i) Iso Choose two convenie he feasible region and plot two objective If the objective is to maximize the objective functio direction of greater value. Otherwise, jt is in the minimization problem. Since the optimal solution lies at thi a parallel line to the objective function in the direction of its improveme’ passes through the farthest corner point. Both the methods give us the same optimal solution. This chapter Yoouses on the corner point method for solving an LPP graphically. ‘The optimal solution is generally unique, ie., one solution that optimizes the objective function, There are some exceptions which shall be discussed later. ar Programming Problem int) of Solving a Line od, comprises the following Graphical Method (Corner Po Solving LPP involving two variables by graphical meth’ |steps: fh of constraints treating inequalities as 1. Plot the constraints. Draw the grap! equations. 2. Identify the feasible region. Highlight the feas solutions with respect to each constraint. d the common feasible region. Find the area 0 with respect to all the co simultaneously. natraints 4. Locate the corner points. Fini fhe ek Bae region by ingpection oF by solving fhe function at each of the intersecting be imal “on, Evaluate the objective ‘nd the optimal solution. itn te see corner points and select the values of function, sible region containing feasible 2B wn the graph that is feasible (vertices) of the feasible g lines of equations.‘am BUSINESS MATHEMATicg The following sections explain the technique of graphical method for a maximization problem, minimization problem and the exceptional cases, beginning with a standart LPP which is a maximization problem with all "<" constraints, Then, discussed are mig constraints, “x 2, =, < 9” type constraint as well as different types of feasible royisy shapes—quadrilateral, triangle, line segment, one point, ete. Later, the exceptional ees of multiple optimal, infeasibility, unbounded solution and redundancy are include? 13.5.1 Maxi A standard LPP involves maximization of the objective function subject to all < constraints and non-negativity restriction for all the decision variables. Howeves there are a number of problems involving different combinations of viz., all < as well as a mix of <, = and > constraints. ization Cases the constraints, Standard LPP (with < constraints)— Feasible Region Bounded by Both the Axes In this section, examples of standard LPP where the objective function is of maximization type and all the constraints are < type are discussed. The common feasible region will be bound by both the axes and one of the corner points will include the point of origin, Example 13.12. Solve the following problem graphically: Maximize Z = 30x, + 25x, Subject to the constraints: 2x, + Bxy < 40 289 A) 4x, + 2x. < 50 B 1S (2) Bx, + 2x, < 60 Die * (3) Xp %>0 2-450 Solution: Step 1. Convert the constraints into equations. 2x, + 3my= 40 1) z 4x, + 2x» = 50 (2) BA 5x, + 2x = 60 (3) rao Step 2. Plot the equations graphically. 2x, + 8x, = 40 wa(L) x 0 20 se 13.3 0 Ate, + 2x, = 50 (2) ) H 0 12.5 x 25 0 Bay + 2x = 60 (3) ve = 7 7 Ferns Region x Xy 30 o 2-4 6 8 10 1\i4 16 18 20%soRMULATION AND GRAPHICAL SOLUTION, see? 13.21 3, Find the feasible solutions. Mark the feasible region for each line b; 10.0) on either side of the line satisfies checking whether a point (generally es the inequalit ae y. For example, put (0, 0) in inequality (1) we ; ; q oni Jett side area of the line (containing the Ect. 9 5 40 which is true therefore area for line representing (1). The shaded area satiaf , 0) is the feasible is common feasible region, OABCD. ‘ying all the constraints 4, Determine the corner points. ste () A (at the intersection of y-axi = . . 20) +3x,=40 > x= aa (=, = 0) and line for equation (1)), (i) B (at the intersection of lines of equations (1) and (2)), 2x, + 8x2 = 40 => 4x, + 6x, = 80 and 40 -3(7.5) a 30 4, + 2x, = 50 > m= = 75 and x= (iii) C (at the intersection of lines of equations (2) and (3)), dx, + 2x, = 50 and 5x, + 2x, = 60 = my = 10 and x, = 2309 - 5. (jv) D (at the intersection of x-axis (tg = 0) and line of equation (3)), 5x, + 2(0) = 60 => x, = 12. Sie 5, Evaluate Z at the corner points. Determine the optimal solution. | Corner Points Coordinates Z = 30x, + 25x A (0, 13.3) 332.5 Bt (8.75, 7.5) 450 C (20, 5) 425 D 2, 0) 360 *B gives maximum value of Z. Therefore, Z = 450 is the optimal s« Maximization of LPP with Mixed Constraints— Feasible Region Bounded by One Axis / va Ifthe LPP hi jecti «on of maximization type and the constraints include tive function of m: a oth > and . cate een the common feasible region may or may ‘not be bound by any axis. ‘Phe following example illustrates case where the feasible region is und by one of the axes only. oo Example 13.13. Solve the following problem graphically: ge 029 olution for x, = 8.75 and x, = 7.5. ileximize Z = 50x + 30y = ints: a-e0 ‘ct to the constraints: : o ean d? 34 2) e472 iB ~ wees (Delhi Univ. B.Com. Hons., 2009) xy2013.22 BUSINESS MATHEMATIog —Aricg: Solution: . Step 1. Convert the constraints into equations. 2x + y = 18 =) x+y=12 y 3x + y = 34 Step 2. Plot the graphs of the equations. Qx+y = 18 % 0 9 (ye ° . ‘ommi 18 0 Feasible Region xt+y=12 = 0 y 12 Bxty=34 (3) x Zee 0, 11.3 x 34 0 Step 3. Find the feasible solution: common feasible region ABCD satisfies all the constraints. Step 4. Determine the corner points. (@ A (at the intersection of lines of equations (1) and (2), Qx+y=18andxt+y=12 > x=6andy=12-6=6. ( Gii) C (at the intersection of y-axis (x = 0) and line of equation (3), y = 34 B (at the intersection of y-axis (x = 0) and line of equation (1), y = 18 | (iv) D (at the intersection of lines representing equations (2) and (3)), x+y=12and 3x+y=34 = 2r=92 > x= 1landy=12-11=1 Step 5. Evaluate Z at the corner points. Determine the optimal solution. Coordinates (6, 6) (0, 18) (0, 34) 4) *C gives maximum value of Z. Therefore Z = 1020 is the optimal solution at x = 0 and y = 34. Example 13.14. Solve the following problem graphically: Maximize Z = 7x + 10yMULATION AND GRAPHICAL So} ae ; LUTION ‘am ay to the constraints: gai ° x+y < 300 Ze y < 120 x2 60 ast (4) x y20 (Delhi Univ., B.Com. Hons., 1990, 1996) golutiom: step 1 Convert the constraints into equations. x+y = 300 a y = 120 x = 60 ney sep 2. Plot the graphs of the equations. =120 (2) x+y=300 — ...(1) z 0 300 % 0 Th y 300 0 ; 50 Aa foes (8) (4) = a Bo & 60 100 = e 200 y 0__| 100 y M30 @ \/ x go 90 120 450 180 210 240 270 300 : “ @ ep 8. Bi | * Find ti ible solution. peer e the common feasible region ABCDE Mark the feasible region and shad satisfying all the constraints.13.24 BUSINESS MATHEMATIOg Step 4. Determine the corner points. (@ A (at the intersection of x-axis (y = 0) and line representing equation x = 60 and y=0 (id B (at the intersection of lines representing equations (3) and (4)), x=60andx=y > y= 60 (ii) C (at the intersection of lines representing equations (2) and (4)), y=120andx=y > x= 120 (iv) D (at the intersection of lines representing equations (1) and (2), x+y = 300 and y= 120 = x= 300-120 = 180 (v) E (at the intersection of x-axis (y = 0) and line representing equation () => x= 300. . Step 5. Evaluate Z at the corner points. Determine the optimal solution. (3) Corner Points | Coordinates Z = T% + Idy A (60, 0) 420 B (60, 60) 1020 c (120, 120) 2040 D* (180, 120) 2460 E % (300, 0) 2100 *D gives maximum value of Z. Therefore, Z = 2460 is the optimal solution for x = 180 and y = 120. Maximization LPP with Mixed Constraints— Feasible Region Triangular in Shape This section illustrates LPP with the objective function of maximization type with mixed constraints, i.e., both > and < constraints, where the feasible region is not bounded by any axis and has a triangular shape. Example 13.15. Solve the following problem graphically: Maximize Z = 17x + 27y Subject to the constraints: 2x + By > 18 Ze 195 x + y > 10 Bed xtys8 ¢ 26 my20 Solution: Step 1. Convert the constraints into equations. 2x + By = 18 of) Qx+y = 10 10) xt+y=8 --@)ee FORMULATION AND GRAPHICAL SOLUTION 13.25 step 2 Plot the graphs of the equations graphically axt 8y=18 a) y z 0 9 @) » 8 0 ax + y= 10 (2) ®) x 0 | 6 . x 10 0 (1) rty=8 @) Feasble Region x 0 8 y 8 0 Step 3. Find the feasible solution and mark the feasible region for each line and shade the common feasible region satisfying all the constraints. Step 4. Determine the corner points. (® A (at the intersection of lines representing equations (1) and (2)), 10: oe (ii) B (at the intersection of lines representing equations (2) and (3)), Qxt+y=Wandrt+y=8 > x=2,y=8-2=6 (ii) C (at the intersection of lines representing equations (1) and (3)), 2x + By = 18 and x + y = 8 or 2x + 2y = 16 > y=2andx=8-y=8-2=6. Step 5. Evaluate Z at the corner points, Determine the optimal solution. Qx+ By =18and2x+y=10 > y=4, Corner Points Coordinates Z= 1x + 2ty A @, 4) 159 Bt @, 6) 196 c 6, 2) 156 *B gives maximum value of Z. ‘Therefore, Z = 196 is the optimal solution for x = 2 and y = 6. Maximization of LPP with An Equality Constraint Feasible region is a line segment. wPhis section illustrates LPP with the objective function of maximization type and the constraints including > and < type, where the feasible region is a line segment. Trmay result in a special case where there are more than one optimal solutions or multiple optimal solutions.13.26 BUSINESS MATHEMATIC, Example 13.16. Solve the following problem graphically: fi Maximize Z = Tx + 9y Ze 5D Subject to the constraints: xty=6 As D2 4x < 16 -4 by < 20 ¢ zy20 Solution: ; Step 1. Convert the constraints into equations. xty=6 (1) j 4x = 16 (2) by= 20 ...(8) Step 2.’Plot the equations graphically. at ‘Step 3. Find the feasible solutions. For equation (1), all the points lying on the line representing ( feasible points that satisfy (1). Mark the feasible region for the other two and shade the common feasible region satisfying all the constraints which the line segment AB. Step 4. Determine the corner points. / x+y=6and by=20 > y=4 > x=6-4=.2 : (ii) B (at the intersection of lines representing equations (1) and (2)), xt+y=6and4r=16 > x=4andy=6-4 = y=2._ Step 5. Evaluate Z at oe corner paints, Determine the optimal solution. +A gives maximum value of Z, therefore Z = 50 is the optimal solution a x=2andy=4.— LPP FORMULar, Te 1a 7p NO GRAPHICAL SOLUTION _ iS.27 Example 13.17, soive 4 —— oe Maximize Z fhe following problem graphically: = 4x + gy Subject to the constraints: ety ae +1) x22 +e(2) ys4 ++(8) %yY2O Wethi Univ., B.Com. Hons., 1992, 2003) Solution: Step 1. Convert the constraints into equations, ety=5 +) x=2 ++(2) S14) ++(8) Step 2. Plot the equations graphically. xtya5 (1) 0 50 y 5 0 x=2 -+-(2) x 2 2 0 5 Sep 8. Bi i tions. “™p 3. Find the feasible solution: : ae For equation (1), all the points lying on the line representing (1) nee feasible points that satisfy (1), shade the common feasible region sat ig all the constraints which is the line segment AB. Seo 4. p, i : * Dete: he corner, points. @ nN a th intersection of x-axis (y = 0) and line representing equation (1)) a e > x=5 (®) B (at the intersection of lines 5 | we pecan ty dws mat i i ion therefore the ti ting (8) does not bind the common feasible regio ine represen if it is removed from the LPP, the ‘ ‘aii ii nt, Even if it is ¥ eee sslation wae ie ee This special case of redundancy in will rem: " discussed later in detail. presenting equations (1) and (2)),13.28 _— BUSINESS M. ATHEMATIOg Step 5. Evaluate Z at the corner points. Determine the optimal solution. Corner Points Coordinates Z = 4x + by A 6.0) 20 Bt @, 3) 26 *B gives maximum value of Z, therefore Z = 26 is the optimal solution at x=2andy=3. Maximization of LPP with Mixed Constraints— Common feasible region is a single point. This section illustrates an example of LPP with mixed constraints including both > and < constraints, such that there is only one feasible solution lying. at the intersection of all the constraints. Example 13.18. Solve the following problem graphically: Maximize Z = 5x + Ty Subject to the constraints: 10 34 68 0 10 34 68 xtys< Sx + 4y > 8x + By < aye Solution: Step 1. Convert the constraints into equations xty= Bx + 4y = 8x + By = Step 2. Plot the graphs of the equations, x+y=10 +) 0 10 cA 10 0 3x + 4y = 34 +(2) 0 11.3 8.3 0 8x + 5y = 68 +(8) 0 8.5 13.6 0 Step 3. Find the feasible solution. ” Mark the feasible region for each line and then mark the common feasible region satisfying all the constraints which is the point 12345678SN cep 4. Deterp. 2 SRAPHICAL SOLUTION step 4. Determin : Ais the yo.’ Mer points, Poi * . - . Solving them, yet intersection of lines representing equations (1), (2), and (3). 13.29 = +y=10 e(1) Pubs = 10_y in ae > 800 ~ ») + ay = 34 > 80 ~ ay + ay = 34 im 4 Put x = 10 ~ y in (gy, = 8(10 — y) + by = gg > 80 - ay + 5y = gg > ye4 x=10-4=6 Step 5. Evaluate the objective function Z at point A. Determine the optimal solution, Corner Point Coordinates Z= 5x + Ty A (6, 4) 58 A gives maximum value of Z, therefore Z = 58 is the optimal solution at x = 6 and y = 4, Maximization of LPP with x >, =, < y Constraints This section illustrates the case of LPP with the constraints of the type “x>, =, <9”, Trample 13.19, Solve the following problem graphically: Maximize Z = Ox, + Tg Subject to the constraints: ay + Ax, A 500 175 100 1400 A % A % In Tx + 42g v 4x, 2% v ° Xy, XQ Solutions \ i i ‘ions. Convert the constraints into equatio sob oth te, +b 100 Xe = wel), 4, + dxy = 500 ...(L), y= 175 2) 4% ~ x = 0 (5)13.30 Step 2. Plot the graphs of the equations. Step 3. Find the feasible solution. BUSINESS MATHEMATIC; x + 4x_ = 500 — ...(1) 7 8 x f Tx, + 4x, = 1400 «..(4) x 0 200 X» 350 0 Ax, — = 0 +5) x 0 50 100 % 0 200 | 400 Xp ...(5), we cannot take Mark the feasible region for each line. For 4x, 2 t is taken on any side of — (0, 0) because it passes through it therefore, a poin the line and evaluated to decide feasible area. For instance, take (100, 0), substituting it in (6) gives 400 > 0 which is true. Therefore, the area including (100, 0) contains feasible solution with respect to constraint (5). Shade the common feasible region satisfying all the constraints. Step 4. Determine the corner points. @ 00, 0) (ii) A(at the inters: xy = 100 and 4x, =x > 4x = 100 > 4 = 25 ) B (at the intersection of lines representing equations () and (3), ar, + day = 600 and = 100 => x, = 500- 4(100) => = 100 (jv) C (at the intersection of I + day = 500 and 7x; + 4x = 1400 => 6x, ection of lines representing equations (3) and (5), (iii) ines representing equations (1) and (4)), = 900 => x = 150 xy 500-150 and x,=——g = 87.5 (v) D (at the intersection of lines representing equations (2) and (4)), xy = 175 and 7x, + 4% = 1400 => 7(175) + 4% = 1400 175 _ = mop 7487