eee LPP—-SIMPLEX METHOD QNVOLVING SLACK VARIABLES ONLY) I. INTRODUCTION hod of LPP is limited to two variables, we have look to other procedure which offers. an efficient means of solving more complex LPP. Although the graphical method of solving LPP is an Invaluable aid to understand its basic structure, the method is of limited application in industrial problems as the number of variables occuring there is substantially large. So another method known. Assimplex method is suitable for solving LPP with a large number of variables. The method though an iterative process progressively approaches and ultimately reaches to the maximum or minimum. value of the objective function. The method also helps the decision maker to identity the redundant san unbounded solution, multiple solution and an infeasible solution. oped by linear mod ain sol Simplex method also called Simplex Technique was de mathematician, It has the advantage of being unive el for which the solution exist can be solved by it. In principle, it consists of starting with a cer ion of which all that we know is that. it is feasible Le. it satisfies non-negativity. conditions. We improve this solution at consecutive stages until after a certain finite number of stages we arrive at optimal solution. Dantzig, an American For the solution of LPP by simplex method, the objective function and the constraints are first put in the form of a standard mathematical. model, then they are presented in a table known as simplex table and then following a set procedure and rules the optimal solution is obtained) making step by step improvement. This isan iterative procedure where each step leads closer and closer to the optimal solution. This is done by removing, one basic ble at one time from the solution and. replacing it by a decision variable. This process is repeated till no further improvement in the solution 1s possible Steps in the solution of linear programming problems by simplex method Step L. Standard Mathematical model. For solution by simplex method a linear programming problem is first expressed in the form of a mathematical model. The standard form of the simplex model is as given below:za OPERATIONS RESEARCH Maximise : = Cy Xy 1G) ¢ vy Xn yay Iygty A osc t tygty SE) BY Ayty Hyp dy 4 dinXn CS * 2) be At) 9 Ag X24 es in Sy = 2) Bow 20 ily let 20220, we y,, are the variat and fin where a es. her "oF (5) or equal 10 oF more The objective function in a linear programming problem can be ¢ minimisation, Eurther the constraints can be either equal to or Jess than type f than type: (2 ) or equal to type (=). Dillerent types of basic variables: known as slack variable, surplus variable and artificial variable, are used to change from the inequalities to equalities. II. PURE MAXIMISATION PROBLEMS When the objective function °Z: is of maximization and all the constraints are type, then we use w Slack variables are added into the objective function with O° coefficient and vith } coefficient in the constraints in such a way that if forms unitary matrix. The problem is solved when ive get the ansiver in the final table when all C;~ 7 are 0. In brief the following steps are followed 1, Objective function is of maximization. 2. All constra 3. Sa only slack variabl nts are S type variables ar “idea, with ‘O' coefficient in the objective function and 1 coefficient in the constraints in such a way that it forms unitary matrix. 4. Zyand C,~ Z, is computed as explained below in example no. 1 5. Entoring variable is relected with key column having, maximum value of C,~ Z ding the solution value with the corresponding coefficients 6. Minimum Ratios calculated by of key column, 7. Leaving, variable is selected with Key Row having positive minimum ratio. 8. Step no. 4 to 7 are repeated till we get the Optimum solution in the final table when all G-Zs0. Example 1. Solve the following LPP Maximize Z= OX BXp Subjectto—— 30X, + 20X, = 300 5X14 10% = 110 Xi X22 0 Converting inequalities to equations comits ep is toconvert the inequalities into equations, We do this by adding slack variables teach . Each slack variable corresponds to the amount of unused capacities or resources for the Sart les it e added We will use the symbol S to represent slack variable. The slack the equation seating a mants te make equalities, The whatever values required to mak 30X) 420X245; = 300 : 5X) 410X245) = 110x METHOD (INVOLVING SLACK VARIABLES ONLY) “pathod any unknown that occurs in one equation Mifect an equation are written with a zero covet ws which yields no profits, these variables are added to ont unUSEST ste problem in its form can be written as ei = 6X + 8X2 + 051+ 0.5) “Nas Lo 30X; + 20X2 + S1 +0. S2 = 300 subject 5X, + 10X2 + 0S; + Sz = 110 X1, X2, Sp, 52 20 hat current solution has two variables with slack variables S, and S, te veand two variables (decision variable xy and x2) with zero value. The variables with non tio ’ om values are called basic variables, the variables with zero value are called non-basi¢ se ro a ables sill alway: sari n observe that there will always be the same number of basic variables as these are the we ca ints, provided the constraints are non-redundant and that basic feasible solution Ne “constraints, provide er sure oon with basic variables can further be divided into two categories feasible and infeasible, exists rake the equation in the problems easier to handle they can be put into tabular form as fllows: b Simplex Table wust_ appear in all equations, The example, since S, and S; the objective function with inp ul iat co ROL od time where vat with non-zero gj _Contribution Per Unit 6 8 0 0 | Basic Solution XX 5; S; | Minimum Ratio Variable Values St 300 30-20 1 0 | 300/20=15 Sy 110 5 10% 0 1 | to/to-11+ Z 0 00 a) Key Raw G-% 6 8 00 (Leaving Variables) T (Entering Variable) Key Column. The G, indicates the contribution per unit to the objective function of each of the variables. The fist column heading lists the co-efficient of the objective function of the current basic variables. The econd row of the table provides the second column. represents the basic variable in the current ‘olution. The third column headings represents solution values in the current solutions. To find the profitfor each solution and to determine whether the solution can be improved upon, we have added two more rows to the simplex table Z, and CG, ~ Z; rows. The value in the Z, row under the solution value column represents the total profit from this solution ie. zero. The profit from this solution is found by multiplying the profit per unit of S) (je. zero) by the quantity ofS; in the solution (300) plus the profit per unit of S2 (0) by the quantity of Sy in the solution (ie.110). Total profit for the first solution is Number of unused hours of $1 = 300 Times profit per unit of Sy x0 + Number of unused hours of Times profit per unit Total profitye OPERATIONS Reg B he objective function that will q vin the value of t To , presents the decrease in e erfore, th econ at will Be Zo oan He TO feet cae an oan, 2 aaa eerie BY SUMO He int set) associated with Corresponding ba Piney Tales om Sse pet unit (Z; ) row values: are Sedan as given below. " *atiabje “ tan example, contebution (Z,) = summation of {coefficient of G column : Contibation hss per unt OS corresponding Co-efficients of the const, Straing se X 3040 x5 , ; een sia , values for other column as shown under. : Sear (Total profit) = 0 (300) +0 (110) = 0 ‘ Z, for column X; = 0 (30) * 0()=0 ; for column X2= 0 (20) + 0(10)=0 Z, for column $= 0(1) * 0(0)=0 Z, {or column $; =0 (0) +0(1)=0 | Calculation of net profit ‘of each variable is as follows | i i E Net contribu Yadable | Profitperunit- _ Netloss perunit eon Ss — 4 Si-Z | x : = 0 7 t : 7 ° é X 8 Sr 0 i 0 7 0 Sz 0 - 0 By camining C,~Z,row, we can see that total profit can be increased by ® 6 for each unit of, | added to the mix or by €8 for each unit of Xz added to the mix. Thus a profit value in the C,~Z 9, indicates that profit will be improved by the amount for each unit of Xy or Xz « On the other hands | negative value in the C,~ Z, row would indicate the amount by which profit _would decrease. Hene the optimum solution ts reached when no positive number remains in Cj ~ Z) row, that is nomoe | | profit can be made. Developing the second solution We are giving the five steps needed to move from initial solution to improved solution. Step-I. Determine which variable will increase the maximum profit per unit. Consider all psitve | | number in C,~ Z, row and we select that variable which gives the largest positive value. We selec}; as the variable to. enter the solution mix and identify its column with an arrow as the key [Link] | other words the pivot column or key column is that column which has the largest positive value inthe | ,2; row or in other words that column where product will contribute the maximum profit perunt. | Inspection of the C; - Z; row tells us that variable X should be added to the mix, replacing one the variable presently in the mix. | Step-II. Since X2 is about to enter the solution mix, we must decide which variable is tobe | replaced. There can only be as many basic variables as there are constraints in any LPP, so either Si | Sz will have to leave to make room for the introduction of X3 in the basic. To identify the key rove number in the solution value is divided by the corresponding number in Xq column which ise) | column. Select the row with the smaller non-negative ratio as the row to be replaced. In this cae ratio would be 300 For S; row : Sy =15 ForSrow == ll | |a i ay eTHoD (INVOLVING SLACK VARIABLES ONLY) plex tve ratio, itis called there depart wile malle nive that nob a negativ, g the sium scaled the Key element andis denoted by a 3 mn re seit whi ves in the simplex io EM we have decided which variable is 10 enter the sok a Now fevelop the 2nd improved simplex table. yet MX (x2) and wh d plex table hich is to The step involy row or pivot row. This is done by dividing every nach Y humbey es computing set) Tinthe key row by 110 5 10 0 1 = = 285; Da1,—-g 1 10 10 10 ¥ a9 = % 76 1 1 «, row should be (u, 510, a) pte Xe sould Be ; i e new values in the C; column accordingly. Put all other . ago ur example this new row becomes "lather values so obtained atthe gee PO 8,X2, 11, 1/2, 1, 0, 1/10. -Tocomplele the 2nd table we compute new values forthe remaining seg Ts in the table are calculated using the following formula oY All Fema gpnent in)_[Intersectional x. {©oresponding elements Fpow } [clement of old row in replacing row _}| = (New row) \' isa is formula nev’ S; row is obtained as follows : £X, feeSlution value column = 300 ~ 20 x 11 = 80 row fy Xcolumn = 30- 20x 5/10 = 20 wae Acta = 20-20 x1 =0 wore | for; column = 1-20x0 =i for Scolumn = 0-20 xI/10 =-2 Trrefore the values for the new row become 0, $y, 80, 20, 0, 1, -2. Sep V The final step of the 2nd iteration is to introduce the effect of objective function. This tive | sthescomputing the Z, and C,~ Z; row. Z; are calculated as follows : XUV profit) = 0) x 60 = (6) x11 = 88 ihe BlarX;column) = (0) x 20 + (8) x 5/10 =4 nit. | JorXyeolumn) = (0) x 0 + (8) x1 =8 2of for $y column) = (0) x1 + (8) x0 =0 ve —_forSycolumny = (@) x (-2) + 8) x1/10 = 8/10 or §-4represent the net profit that will result, if we add one unit of each variable into the solution. ey | | liable “| Profitiunit G; = Profitloss/unitZ, = _Netprofit/unit C;-Z) he x 6 _ 4 - 2 % 8 - 8 = 0 5 0 - 0 = 8 & 0 = 8/10 = shh,OPERATIONS fi NR ieee Simplex Tabl Simplex Table Gn Contribution Per Unit 6 e 0 0 1 [Basic Var. Sol, Value Xe St Sy Minas = 80 30°02 | Bay ee ° i 50 tO 10 | 1 + Sty, . 38 7 80 8/10 G-& 2 0 0 = 8/10 1 manner, the next improved solution is given by Proceeding the same a eretes Tabte tI G- Contribution Per Unit | [Basic Variables _|_ Solution Value 6 x 4 8 X 9 Zi 96 G74 Ans.” C)~Z; < 0, hence option solution where Z,~ 9, Summary of steps in the Simplex procedure for maximisation problems. 1, Set up the inequalities describing the problem constraints. 2. Introduce slack variables and convert inequalities into equations. 3. Enter the equalities into the simplex table. 4, Calculate the Z, and G, - Z; value for this solution. 5. Determine the entering variable by choosing the highest C; - Z; | 6. Determine the row to be replaced from the minimum ratio column (only compute the ratofo: 50 rows whose element is greater than zero. Hence omit ratios like “= ® and —y=-Set . Compute the value of the new key row. H Compute the values for the remaining rows. 9. Calculate C and Z, value for this solution. 10. If there is non-negative C, - Z; value return to step 5 above. 11. If there is no non-negative C, ~ Z, values the final solution has been obtained. Example 2. .\ company manufactures 3 type of parts which use precious metals platinum angel! | Due to shortage of these precious metals, the govt. regulates the amount that may be used per dat. The relevent data with respect to supply requirements and profit are summarised in the table shown belo ex Product Platinum Gold Required Profit per unit (gm.) per unit (gm) per unit (®) A 2, 3 500 | B 4 2 600 | c 6 4 1200 | : “om Daily allotments of platinum & gold are 160 gm and 120 gm, respectively. How should the om” divide the supply of scarce precious metals ? What is the optimum profit ? | aotPLEX METHOD (INVOLVING SLACK VARIABLES ONLY) pe FEE on. Step 1 Formulation of LPP. Ea $a sree ae tree IYPeS of products A, B & C are expressed in number of units as X;, pect ; Xr & X faximize Z = 500 X) + 600X2 +1200X3 ~ Profit maximisation 14 % M re two types of constraints, There a _ i Tipe 10. 2X1 4X24 OX S160 ~ Plantinum constraints 3X) +2X2+4X3 = 120 ~ Gold constraints XuXoXy = 0 ~ Non-negativit Where ‘gativity see 2 baal sine wariables Si Spo convert the inequalities < into = type, where S) & S) 20. pox. 2=500X1 +600X2+ 1200%3 +05) + 05, subject tO 2X) + 4X2 + 6X3 +5) +08) = 160 3X; +2Xp +4X;+05,+8; = 120 Where X1, Xa, Xgand S,, 8) = 0 ‘he above changed problem can be put into the following Simplex Table I Simplex Tablet Ge 500 600 1200 0 0 | [Basic Var. ] Sol. Value [XX XS; Sy | “Min Ratio 0 Si 160 204 6 10 ‘| 160/66 = 26.67> 0 Sy 120 302 4 «0 1 | 30 Zj 0 0 0 0 0 0 G-Z 500 600 1200 0 0 + Following the same procedure we change to next table Il é III, as. Simplex Table I of Go 500 600 1200 0 0 e Basic Var._| Sol. Value | Xi % % 5; S| Min Ratio 1200 X3 160/6 13 2/3 1 We 0 | 80 Sy 80/6 5" -46 0-2/3 1 | 8 Zi 32000 400 800 1200 200 0 G-2 100 -200 0 -200 0 1 ‘gol. . Th Simplex Table III ow: Go 500600, 1200S 0 Basic Var. | Sol. Value X X Xs St So 1200] X3 24 0 4/5 127/90 =1/5 500 xX 8 1 2/5 0 2/5 35 Z; 32800 500 760 1200-160 60 matt = 0 -160 = 60 GZ 0 160Since all Cj~Z, Xoo. and Max, Pro cprablem presenting pharmaco ample Solna prouemingproben npnesertatin pharnacutcyg oe i Thefts topoee thle namely Pracelamo 2 sis 43nd 6 respectively. The im uses thre The profit er strip o each able is, 3a 6, cap rer material Perrin omen of abo forte tales nh respectively. The cpital hous required for these products ave 4 Lane respectively Thing : fanning the profits. ative oF 7009, cof ails =, so we get the opium solution, Xy= No. ot units = 24 OPERATIONS te Sun x 8 H 1200 2h 4 wit Z = S108 4 AMEX 1221 4000-0 4 aay Z 232800. vi Nemusuig gi inputs gy ling. rir persis So vam sect The avin acy ggg ining nara are MO hr, 470 hs and ABO Rilogras, respectively. Cig Solution. Let [Link] unis of Paracetamol =X Lot [Link] unis of Numusuld = Xp Let No, of nitsofnufin=Xq Prod. x % % Mat Alay Input Labour 2 3 2 lig Capital 4 I 3 n Binding Mat 2 5 1 ’ Profit PU 4 3 6 Formulation of above problem as LP problem Max. +N 4 0% Suto XyXa Xs 20 Adding Sack variables to above constraints in order to convert them into equation, et Max. Z=ANy + Ip + 6Nq + 08) +05) + 053 Sub to IK + Ny + 54S) +05) + 05) = 2K, #5Ny + Ny +05 +05, +55 = 490 Go Xp XX 20 Simplex Table 4 | Basic Variable | Solution Value Min. Ratio 0 5 10000 nm 0 S 8000 4708 > 0 Sy 1000 430 Z 0 G4 MS Hayy yt ursigoh he | ly |tive | rif, bow, 2h, lerig} Laud 4 3 saamonvawe| XOX SSW 7 3 |_ Min. Ratio 380/3 2B 7B" 01 3a 470/3 “6 1B 1 0 Ip 9 7 = ’ 20/3 23 43 0 0 ap 4 t 33 3 2 40/7 ' 7 940 6 DO - G-4 2 1 0 0 20 1 Simplex Table I] 4 3 6 7 7 5 ( Souionvawe | MOM OG OSC 4 380 2 3 7 , 7 7 1 0% F =F 0 ° 920 10 1 3 a ZF 0 -> 5 7 7 7 7 ? ‘ 20 2 4 ' 24 3 2 > 3 2 7 6 F F 20 G-Z % 9 0 3 RB 174i “7 = -7 (0 alues in C)~Z; Tow are zero or negative, we are with optimal solution where since all the 37 Zi pt 6960 Z= 47013 = X=0, X2 = 380/7, X3 = 97017 | sample 4. Solve the following LPP Max Z = 100X; + 40X2 abla 40X; + 50Xz <= 900 3X; + U3 Xz < 30 VX, X22 0 Win Stlution, To convert the (2) equation into equality | ntiply by 6 on both sides, Max Z = 100X; + 40Xq Subto—40X; + 50X_ <= 900 9X, + 4Xq = 180 YX, X2 20 Now ; anti introduce the slack variables in the constraints @ inequalities into equalities by assign ‘0’ coefficient to = M Sb Z = 100X; + 40X2 + 0S; + 052 40X, + 50X, + S + 0S) = 900 9X, + 4X_ + 0S, + Sz = 180 () wwl2) before introducing slack variables we Jack variable and Resultant objective function to in the objective.j4.30 | WX; X2 20 function simplex Table 1 ES 7 4 0 O Go % S53) Mi = 1. Value Xi 2 in Rao past we | 00 40 501 0 45/2 : 7 180 gy 4 9) 6 | 9 7 7 0 0. 0 oO + t— =Z Too 40 0 0 i f is Xy and leaving variable is Sp and the key element is 9, s, alue is as shown below : he Simplex Table II 100 40 0 0 The entering variable simplex table with changing ¥ dy Gr [Basic Var. | Sol. Value xy XS Sp Min Ratio 0 3 TOO 7 wus T4079 3 100 x 20 1 4/9 0 (1/9 Z 72000 Too 4009 0100/9 - G-G 04090-10079 Since all the values is ¢ row are -ve and 0. We are with optimum solution, where X1 = 20, X2=0, Z = 2000. Example 5. A manufacturer as two products A and B, both oftwhich are made in steps by machine and machine 2. The process time per hundred for two products on two machines are (set up times negligible) Product Machine 1 Machine 2 A 4 hours 5 hours, B 5 hours 2 hours For the coming period, machine 1 has 100 hours and machine 2 has available 80 hours. The cont for product A is 710 per 100 units and for product B is #5 per 100 units. The manufacturer in market, can absorb both products as much as ke can produce for immediate period ahead. Determine how muckc! product A and product B he should produce to maximize his contribution. Solution. Let the product A be x and product B be x2. The objective function and constraint giver in question are as Maximise Z= 10x, + 5x, Subject to 4x, + 5x2 < 100 Bry + 2x) = 80 where xy, x) 20 We introduce slack variables S, & Sp in order to convert inequalities into equation. The resulst objective junction & constraits are given as Maximise Z = 10x; + 5x2 + OS;+ OS) Subject to 4x1 + 5x2 +S + OS, = 100 Bry + 2ty + OS, +S, = 80 where x1 % Sy S220Simplex Table | (INVOLVING SLACK VARIABLES ontyy inal the values of G; - Z; row are either 0 or negative, w Pooduet A =X; = 200/17 product B= Xp = 180/17 and Z = 2900/17 or contribution = 2900/17 prample 6.A firm produces three products A, Band C, each of roclion Finishing and Packaging. Each unit of product A re ious inthe packaging department. iftiennit contribution of product A is 5, of product B is °10, sasterofimits ofeach of the products, that should be made Aadlernineifany capacity woould remain unutilised. Solution. The mathematical formulation of the given LPP is Max. Z=5X; + 10X, + 8X, Subject to 3X) + 5Xp +2X3 < 60 4X) + 4X2 + 4X3 = 72 2X1 + 4X + 5X5 = 100 Xt Xp, X32 0 Oe _ Solution Value | XX, §; S ~ p00 a Ratio 80 So a 0 00 0 |_ __—_____° 0] G-4 1050p t | Simplex Table 11 105 0 o - Solution Value [| X,___Xy G’. ane Variable jolut om 7 ue * Sy Min. Ratio 1 ~aB a | 3 16 175 0s | ag Q Xi " Z 160 10 4 0 2 G-% 0 T 0-3 t | Simplex Table 11 10 5 0 0 | Sc pggeverabieT Sotation Vale [TG | % 180/17 0 1 Sn? any 5 x 200/17 1 0-217 5p7 0 Z 2900/17 105 # % 800 70 1 8/10 0 1/10 0 | so0o/7 ‘ S 200 3/10 0 «20 0 -1/0 1 | 20003 Zz 32000 28 40 #32 0 4 (O G-Z 2 0 -12 0 -4 0 tSolution Value Simplex Table Ul OPERATIONS Rese, AR Since all GZ} Xr Example 8. A manufacturer of le machines M,, Mzare My, Belt A requires 2 Zhours on machine My, ss on machine Myand 4 honrs on machine My. There i T0hours of time perday available on machine My and 15 hours of time per day available profit gaincat from belt A is 23.00 per unit, from bell Bis ¢5.00 per unit, from belt Cis %4.00 peruny should be the daily production of cach type of belts so that the profit is maxintum =26/16 10/6 “1271 ~ lone 4 Vs 1 32500 3 40 5 a 625, 8 10 15 0 are <0, we are with optimum solution hor belts makes three typ Solution. The mathematical formulation of the given LPP is :- 2+ ANg After introduction of slack variables we convert constraints into equation and efficient to the slack variables in the objective function. The resultant objective function & equation are given below 3X; + 5X2 + 4X3 + 0S; + 0S; + 0S; 2Xy + 3X2 + OXg +S) + 05S, +083, OX, + 2X) + 5X3 +05) +S) +055 3Xy + 2X2 + 4X3 + 0S) + 05) + Sy X Xz, Xa, $1, So, Sa, Simplex Table 1 On Machine, Max. Profit = 32,500 sofbells A, Band Crehich hours on machine M, aud 3 hours on machin’ hours on machine Mz and 2honrs on machine My and Bett ¢, Shouts of lime per day available y hare M, Nequines; M Machine yp cook | 3 7 Basic Variable | Solution Value |X; X3 7 Min. Ratio $; 8 2 3 Oo rr) 8/3= & 10 o 2 55 0 1 0 5 3 15 3 2 4 0 0 1 75 Zi 0 o 0 0 0 0 0 G-Z a re) Procesy My The | Wha assign ‘0’ ce constraintTT | fi _——_—-— Solution Value] Xi XX SS {——__ 2 2 Ss | Min. Rati 8/3 re a | — \ 14/3 3 0 SF aR 0 ” 5 29/3 530 4 28 9 ; M15 ’ po lyin H 1350 5B “130458 t Simplex Table tt 3 5 40 0 ? asic Variable | Solution Value xX; XX Sy SS) | Min Rano 1 % 8/3 2/3 1 0 1/3 0 0 4 5 v 14/15 N50 1-215 1/5 9 ~ve 4 89/15 AINS* 00-215 4/51 Bogs 4 256/15 1/15 54S aS +1/I5 0 0 -I7/15 450 Looe 8 | 1 Simplex Table IV ce 3. 5 4 0 0 0 | [basic Variable [Solution Value [XX XS 3S : % 50/1 0 1 0 151 8/41 10/41 ij Xs 62/41 0 0 1 6/41 5/41 aya ; X 89/41 10 0) 2/41 12/41 15/41 a) OT 35 4 ‘ii 24a) 1171 | G-Z 0 0 0 45/41 -24/41 -11/41 Saee are C,-Z; <0, we are with optimum solution [Ans. X, = 89/41, X2 = 50/41, X3 = 62/41 Max. Profit = 765/41) Secial Cases in Applying the Simplex Method (Complicated Situations) Seal complications can occur while solving the LPP, Such problems are: | Tieforthe key column 2. Tie for the key row (degeneracy) 3. Unbounded problems 4, Multiple optimal solutions 5 Infeasible problems 6. Redundant constraints | 7. Unrestricted variables. haf these complications and their resolutions are discussed below : / udlie for the key column. The non-basic variable that is selected to enter the solution is cro by the largest +ve value in case of maximisation and the largest -ve value in case of breach Problem can arise in case of tie between identical CG ~Z; values, ie., two ono 7 Coney) the same +e or negative value in the G; ~ Z row. In Such a situation selection for ke Gn be made arbitrarily. There is no wrong choice, although selection of one variable may MRT aa ler next chapter for minimisation casesOPERATIONS Rege, PE irtiow or when olunnn is dhonaayy Ay result in more te ation (Le re tal “ solution will eventually be foune nlex method degencras ‘al oneracy). Inthe simple pinerncy uray 2: Tl orth Ho mee. The wrong, selection ean tent naing the departing, for the minima ratio for hoes te The ron cet wt "a ri it sation and may Ie or looping, and can theoretically contin, fof salution ar iteration and sad to cyeliDg, ue ig ety golution. However, in practice after infin vane yielding an opunun solution alter a number oi ¢f simplex method never yl Jaling, ar Tyand eventually read er of a Hime ee ene proceed normally and eventually ; han optimum gq. ein dl rer yack to degeneracy isthe Were ithe computation, which reduces the ees ttn ne Sex metho con ably, Asa general ule, the Dest way to break the tie between the yer? aon atest any departing, variable My ite are unicky and cycling does occur, ye gy ie to select any departing ¥¥ We si goback and select the other ‘Alternatively. The following procedure !S followed : {) Locate the rows in which smallest non-negative ratio are tied (equal) (i) Find the evefficient of the slack variablesand divide each coefficient by the corresponding poy numbers of the key column it the row, starting from left to right in order to break the fe. {ii If the ratios do not break the Ue, find the similar ratios for the co-efficient of decision varia, {io) Compare the resulting ratio, column by column. (®) Select the row which contains smallest ratio. This row becomes the key row. fei) After the resolving of this tie, simplex method is applied to obtain the optimum solution Some authors have suggested that in case of tic, the row nearest to the top may be selected Similarly if tie has occured between artificial variable & other variable, the artificial variable shoul be selected as departing variable without going for the above procedure. Although cyclying js theoretical possiblity it seleom occurs in practical problems, However the general method of resolving viced, which if followed will ensure against falling in the cycling process.» ad tog degeneracy have been di Example 9. Max. Subject to 5x1 + 2x2 < 10 ai 4,22 20 to have positive constant at 2x, - 8x2 2-12 wliii) Solution. We multiply the constraint three with -1 on both sid the HS. we get Max. Ze 5x1 43%, Subject to typ 82; 5x1 + 2x2 < 10; 2x, + 8x2 < 12 We introduce slack variable and ossign ‘0’ coefficient and convert the constraints in to equation Resultant objective function & constraint equations are given below : Max. Z.= 5x, + 3x2 + 0S) + 0S) + 0Sy abject to ay xp +S1 +05) +053 = 2 Sy + 2x + 05y+ Sp +055 = 10 2x) + 8x2 + 05; +052 +S3 = 12 1X2, Sy, Sz, $3 20 plex Table I GC, > Contribution per unit 5 3 0 0.0 Basic Variables | Solution Values | x, xy Sy S) 53 | Min. Ratio 0 Sy 2 Yr 1 1 0 0 |2> 0 Sy 10 5 2 0 1 0 42 0 Sy 12 2 8 0 o 146 4 9 00 0 0 0 G-4 5 3 0 00pution Pet unit Solution Values {_< we have obtained optimum solution Jemen' ego UAE me 270 Z = 10 (Maximum Valuey Contribution per unit 1 Tasie Variable [Solution Value [x1 82 Ee 0 3 22 3 0 3 T 0 0 Pa 0 S iM 12 x0 01 0 | as 0 Ss 4 3.2 0 0 0 1 fe z 7 . 0 . 0 0 0 ~ 1000 4000. 5000 0 0 0 1 Simplex Table Il G > Contribution per unit 1000 4000 5000 0 0 0 | [Basic Variable [Solution Value [1 mS St 3) Min. Rat 0 3 5 z rr o) ot 5000 X3 14/3 V3 2/3 1 0 0 7 0 S3 14 3 2 0 0 1 7 Z 70,000/3 5000/3 10000/3 5000 0 5000/3 0 G-G -2000/3 2000/3 0 0 -5000/3 0 1 Degeneracy is resolved as under 1 3 Ss x3 0 2 0 Ss 0 0 12+ Since the ratio could not break the tie, we have arbitrarily taken S; as departing, variable as Xs! entered in the previous table. Simplex Table IIL G > Contribution per Unit 1000 4000 S00 0 0 0 J Basic Variables] Solution Values | x, 3 5) 92 $3 0 Si 22 5 0 ot -l 1 5000 X3 0 2/9 0 1 0 1B WS 4000 X2 7 32 1 o 0 0 n Z 28000 8000/3 4000 S000 0 _s000/3 1000/3 | G-% -5000/3 0 70 5000/3 -1000/3 Since all G - Z; < 0, we are with optimum solution 11-0, =7, x3=0, Z=28000NVOLVING SLACK VARIABLES ONLY) — Mamafaturigg Company, received an order for thee ecial Type of gears for 4 ie or ent is considering to devote the available excess * 4 Mae rls (0 capacity to one or more of the 0 i rand ‘¢, The available capacity on the machines which might limit output and the V foreach unit of the respective gear is also given below Available Productivity is M/C Hrs/unit Machine Hrs/Weak | Gear A Gear B Gear | i 250 8 Gag machine 2 3 [Gear tng machine 150 4 3 0 1 : cra paingenaching 50 2 - 1 ea 721 FS respective a : rapid wwould Be 20, 6and @S respectively for the Gears A, Band C respectively. Find how i a the company should produce in order to maximise profit ? en “Tre mathematical formulation of given LPP is: olution | a ze 20x1 + 6x2 * 8x3 - gry +202 43%3 S250 a) gy 43m 40t3 = 150 ~-Q) 2x 40x) 1x3 S50 8) here 25 xy xy &xs 2 0 tice inequalities are S, so we will add slack variables $,, $2 &S3 in the above three constraints 4. ese inequalities will Be changed to equalities. Now the revised objective function and the seus ‘will be written as. Maximize Z= 2081 + 6t2 + 8x3 +05) + 052 + 0S3 Subject to 8x, + 2x2 + 3x3 + $1 +052 + 0S; = 250 4x, + 3xp + 0x3 + 05) +S) +0Sy = 150 2xy + Oxy + 1x3 +08, +052 +S; = 50 where as x1 Az %3, Si, Sx Sz = 0 from the above LPP. formulation the initial Simplex Table is prepared in the following format. Simplex Table 1 + Contribution per unit 20 6 8 0 0 O has p | [Basic Variable] Solution Value [x1 ™ 33 Si 52 53| Min-Ratio a 3; 250 8 2 3 1 0 Of 1254 a S 150 4 3 1 0) 75/2 , $3 50 2 o 1 0 0 145 Zj 0 0 0 0 00 G-% 420. +6 +8 0.0 t : ea the above Table it is clear that variable x; is entering variable and Ss is leaving variable. x1 ii! lumn and S3 isin the key row and the value of key element is 2. Key row and key column my by sign arrow 1. sal ttoducing the entering variable and removing the leaving variable and with the changing second simplex table is prepared as shown below: =Simplex Table I a mt SC~—SC‘“ aPC 6 20 c Contribution per unit ah " mw 5 SS 7 7 on Value 1 Basic Variable inoue i z TTT 0 ot Sy Ss 0 gy 2 0 1 22 4 S 50 1 0 120 «0 Ip _ 25 20 xX =a 1) 0 10 0 0 10 Zi 7 T 6 2 0 0 -lO i s the entering variable lying in the key column and Jement is 3shown by the asteric*. ‘ar that X2 Sit 2 is theleavng value of key el From table Il itis cle variable in the key’ row and the v Simplex Table IT er Unit20 j C= — Contribution per Unit = ; | 1 Basic Variable [Solution Value x2 83 St S25 | Min. Ratio - a8 0 0 18 1 -22 8150 o - 50/3 0 1 23 0 18 -2/3|-ve So Zz “95 1 0 12 0 0. 1/2]50> 1 * j Z, [00 20 6 6 0 2 6 i 02s GG T v2 z t How Degeneracy is resolved 2 Sy Sz Ss Row Ss 3 -2 -8 “Least +ve value Row X 0 0 TP Hence departing variable | Xs s the entering variable indicated by the key column and X; is the leaving variable indicated by key row. The value of the key elements lying at the intersection of these two is 1/2 which is shown by putting * (Star), Now introducing 3 variable which is replacing x, and with the changed values we get the nat simplex Table IV. Simplex Table 1V G> Contribution per unit 20 6 8 0. 0 0 t Basic Variable | Solution Value |x, xy x3 S; Sy S3 ' 0 5 0 0 or | 6 X 50 4/3 1 o 0 1 0 8 X3 50 2 0 1 0 0 1 Zj 700 24 6 80 2 8 ! G-Z a oo 0 23 Asall th i s all the values in the index row G~ Z is <0, the solution is optimal. ‘ M=0, 19 = 50, a | Max. Z= 20x, + 6x+8 x 3= % | Max, 228 09 220X046 5048 x 50 = 0+ 300+ 400 | |ae Te OLVING SLACK varia me meTHoD_CINVOLVING SLACK VARIABLE: ONLY) nt UNDED PROBLEMS yi no gn be stated that a key row cannot bese al oan tion is unbounded, The table dows Fonte te al fam contin se the LPP. 2, Sel = 5x; + 4xy m7 moe S 8; M20 oduce slack variables Sy, Sin the constraints and coms 1. Me rte fficient in the objective function, and we gett COMVERt inequalities inty ott ig 4+ 4x) +05) + 0S2 ny + AR ws 101g t$1 #052 = 7 Yoo +05) +82 = 8 " ypty Si $2 2 0 Simplex Table T Contribution per unit [s+ os a a mo | Mn Rao | 5 r ‘ ; o 7 ' 8 7 3 a a | G-G fF 7 . p t Simplex Table II Contribution per unit 7 ; : Basic Variables [ Solution Values [x mS | Min Ratio ' % 7 7 7 : : : S 1 5 Ti = 4 35 5 D : : G-Z 0 7 7 a a ae the basis of Cj ~ Z; row, x2 is the entering variable, but on the basis of min. ratio, itis not “So decide departing variable, hence the given LPP has unbounded solution. Stimple 13, Use sinsplex method to verify that following problem has no optimal solution. Mainize Z=x, + 2% ‘aject to: Wy tx +x; <2 “My ta2-93 51 yas S 0 Sdlution. We introduce slack variables Sj and Sy in order to convert constraints into equations wer : Coefficient to Slack variables in the objective function. Set gs *2r #05, +08, ° ~2x4 +x2 +15 +S, + 0S) = 2 “ete as A] #22— 4540S, +S) = 1 Xy, Xz, X3, Sy, Sp = 0 bhSimplex Table 1 1 2 0 ‘i XQ X3 | [Basic Variable | Solution Value] 7% s 2 1 1 ’ S 1 a 9 -1 0 2 0 0 0 Zi Simpley Table II SG T 2 CC i | [Basie Variable [ Solution Value] 12 3 | na - 8 2 1-1 [= 0 5 T T : > | 8 pf tt i G-4 3 0 IE t On the basis of C, - Z; row the entering variable is x but it is impossible to decide the deparing variable from Min. Ratio column as it contains negative element. Hence, the given LPP has unbounded solution. IV. MULTIPLE OPTIMAL SOLUTION In the final simplex table, if the index row indicates the value of C,-Z; for a non-basic variable to be zero, there exists an alternative optimum solution. This is irrespective of whether the variable ig a decision or slack or surplus variable. To find the alternative optimal solution (s), the non basi variable with the C; - Z; value of zero, should be selected as an entering variable and the simplex steps continued. Example 14. Max. Z = 2000 x + 3000 x2 Subject to 6x, + 9x2 < 100 2x, + 1x, < 20 XM 0 Solution. After introducing slack variable $1, Sp in the constraint, we convert inequalities is equalities, and assign ‘0’ co-efficient to slack variable in the objective function. The resultant, objectv® function & constraint equation are given below : Max. Z = 2000 x; +3000x2 + 05, + 0S, Subject to 6x, + 9x2 +S; + 0S, 2x; +42 +08, +15; = 20Simplex Tablet taibution per unit 20003000 > 7 0 - ables Solution Value: xy x Si a ME + In. Rati 5 20 2 Po Pease S 7 1 0 1 | 200 Z 0 0 d 7 7 2000 30000 7 SimplexTable I Contribution per unit 2000 3000 0 T ane variables Solution Values m1 m 3 sie Va : a 10/9 Ws T iF ; 5: Bove 43° 0 “91> t Z TOOOOO/S 2000 3000 100073 0 G4 0 0 =10007s DL. — ee. 1 nat elements in C, ~Z; row are negative or zero, we are having optimum solution ; 100/9, x Z, = 1o0000/3 sealing hat the C)~ Z value indicates the per unit net increase in profit that would be realised -quneing a non-basic variable, we can see that entering variable x; would neither decrease nor sere pot. It would result in a different solution having same Z;. In order to compute the value of sierative optimum solution we introduce x; as a basic variable, replacing S». The resultant “yb thle is given below : Simplex Table III G+ Contribution per unit 2000 3000 0 0 | | [Basic Variables [ Solution Values * 31 3 a0 cy 2075 0 T 17 72 20 n 20/3 1 0 1123/4 Z 100000/3 2000 3000 1000/3 ~~0 G-G 0 0 1000/8 x = 20/3, x) = 20/3, Z, = 100000/3 Ans. _ Hample15.A company produces three products, Py, Prand P3 from tzvo razw materials A and B, and LOne mit of product P, requires one unit of A, 3units of B and 2units of L. One unit of product P2 Seta of and B each, and units of L, while one mit of Psnceds2umits of, 6unis of Ban units “conpany has a daily availability of 8 units of A, 12 units of Band 12 units of L. Its, 5 further known ‘anit contribution margin for the products is 73, 2 and 5 respectively for Py, P2and Ps, 7 . . et vate this problem as.a linear programming problemi, and then solve it fo determine the optimum “Amis. Is the s olution obtained by you unique ? Identify an alternate optimum solution, ifamprogramming, formulation as follows— Maximise Z= 3x) + 2x2 + 5x5 Subject to x + 2s) 424 $8 By + 21y + 6x3 $12 12 Where as ay pas 20 2a +34 +4 Solution, If x), x3 and x3 be the output of the products Py, P, OPERATION, and P3 respective iS ly. we Rese, my i) We introduce slack variables $y, $2 and Sin order to convert inequalities intg 4 aon, Tk resultant equation is as follows Max. Z = 3x + 2xy + 513 + 05) + 05, + 0Sy Sub to 1 + xy + 2x3 +S +05) +05; = 8 yy + 2ny + 6x3 +05) +S) +05; = 12 xy + 3xy + 4x5 +05) + 0S) +S; = 12 where as XyAy Xy Sy, SS; 20 Simplex Table I Ge er) 4 [Basic Variable] Solution Value [1% 5 ~S) Ss | Min. Rate! 0 3 3 i ee 0 S 12 302 6 0 1 4g Qe 0 Sa 12 203 4 0 0 4 3 Zi c o 0 0 0 0 0 G-Z 372. «5 ~«O OO t Simplex Table II Ge 30275 +0 ~+~«O 0 Basic Variable| Solution Value [x xy SS $3 | Min. Ratio 0 3 7 0B 0 1 sO © 5 x3 2 vw 18 1 0 16 0 4> 0 Ss 4 9 538 0 0 73 1 © 10 52358 5 0 56 oO G-G ik iB 0030 t Simplex Table III > 3 205 0 go 1 Mm % S & %& Si 4 G + [ Basic Variable | Solution Value 0 3 a 4 0p (INVOLVING SLACK VARIABLES on, LY) x meTHO! woe with optimal solution x1=4, ay=9, y Boa qe sie 2, 9 NOm-basie variable hasC 7 -p men ? of it " evel in. et soli . we ‘pai Simple Table lv thus, has an 3 I - - 0 Solution Value ym oo G? rpsie Variable 12/5 12/5 12 G-Z 0 ‘ Z, row are either 0 or negative, w : [ Solution Value | 5 oo a 35 0 © get the optimum solution with x 1 seat values 9 G~ z0and = 1 " ene 46. Solve the following : i = wiz en pak 48% sabe to Comsats: 2X, +3X2 < 900 X,+2X_ = 600 OX, + 2X_ < 1200 XyX 20 solution. We convert inequalities into equalities by introducing three slack variable $,, Sp and 5, 1 Sp and $5. | ewe have Nav Z= 6X; + 9Xo+ 0S) + 0S + OSs subject to Constraints : 2X1 + 3X2+ Sp + 0S2 + 0S3 = 900 Xj + 2X_ + 0S) + Sp +083 = 600 2X; + 2X2 + 0S; + 0S + Ss = 1200 X1, Xp Sy, Sp S3 20 Initial feasible solution IE X)=0;X,=0 S)=900; S,=600 ; S3=1200 Simple Table-1 GS 6 9 0 0 O | [Basic Variable | Solution Value | _X: X2 Sy Sp S3 Min. Ratio ; 5 900 2 3 1 0 0 [300 0 S 600 1 2 0 1 0 4300 Zz 0 0 0 o0 o 0 CZ; 6 9 0 oO 0 t bhcoming Variable = Xo; Pivot Blement = 2 Outgoing Variable = S2OPERATIONS Regy, AR . Si Sz Sy 1 Basic Variable a Value Ss 9 x 500 0 1/2 0 9 Xa 3 7 Mi : 0 53 600 ee Z; 2700 : Z -9) C-Zi 0 mm O ' . Incoming Variabl. Outgoing Variable = $1 Key Element =1/2 “Tt Simple Table-IIl S 6 70.0 ~O " 4 Fasie Variable|[Sotation Value] Xi X2__—S1_S2_ SS nae & x 0 1 0 2 3 0 5 9 Xe 300 0 1 -1 2 0 ae 0 83 600 0 0 2 2 1 Bas Zj 2700 6 9 3 0 0 4 0 0 3. 0 0 t Since each value in the C-Zj row is zer or negative, indicating that an optimum solution has been reached. The solution is X; = 0; Xo = 300 ; Z = 2700. Further zero under S2 in CZ, row indicate that the problem has multiple solutions. Second solution is obtained in simplex Table-IV. Simplex Table-TV G-> Contribution per unit 6 9 0 0 0 | [Basic Variable [Solution Value |X; Xe Sy 53 6 xX 450 1 3 Oo 0 0 S 150 0 ; 1 0 0 S3 300 0 -1 0 0 ZG 2700 6 9 0 0 CZ 0 0 0 7 Another Solution : X; = 450; X=0; Vv. AN INFEASIBLE PROBLEMS This condition occurs when the problem has incompatible constraints, Final simplex table & show optimal solution as all C- Z, elements +ve or zero. in case of mimnimisation and -ve or zet i case of maximisation. However, observing the solution base, we find that an artificial variable is present as a basic variable. Both of these values are tolally meaningless since the artificial variable ha* no meaning. Hence, in such a situation, it is said that LPP has got an infeasible solution. Note: Also refer next chapter for details as it involes Artificial variable.3X) 4X) <7 a SX1 + 4X) = 15 atthe second constraint is less restrictive (because b isco Je) than the first one, and is not Fequired. Normale nt €0 Ma are opt the computational work unn nip cedundant conse’ Same a plem ex rily increase trai. doug | e y NC ONSTAINEDVARIABLE/ UNRESTRy vi 4 variable is that d i. positive, negative and Nstraints lable which does TO Vali ca e negative because difference bety mg ae ane de one Negi differ {WO Same tye and CaP Hake ty Cie ables Become ron-negaive in the system Problems sone ABA ale se Neale of original UnFestricted variable eo Dy tkingitas den e285 i ce a erence between ts rBenatosare handed in the ay ansiered in the felon ssh 17. Solv the following LPP S:question sa : te Z=8X1- 4X2 | subjetto MG *5% = 20. i) -X,+3X) = = 23 7 7 wwii) When 20 Jyisumestricted in sign. solution. In order to have RHS value as ve, we ae eel seteunresticed variable X. with non-negative variable nS Tie eallant constraints equation and the objectiv Mia, Z=8X)~4X5-+4X, Sobject 0 Ax, + 5X3 —5Xq X1- 3X343Xy = 23 Xa XaXy = 0 [inoduce slack variables $y & Sy in constraint and assign ‘0’ Co-efficient to slack variable in ‘ecbective function. The resultant objective function & constraint equation are obtained as below : Max Z=8X; ~4Xs + 4X, +05) + 0S) 4X1 + 5X3 - 5X, +S, +05, = 20 X) ~3X5 + 3X4 +05) +S) = 23 Xt, XX, 5,5) 20 Simplex Table 1 int (ii) with +1 and also ‘e function are given below 20 VIIA G Contribution per unit 8-4 4 0 : Sse Variables Solution Values] aya SS] Min a o> 20 Fs 5 T 0 0 3 1 3 3 0 142 0 oo o 0 O SS a EL SR t ftce Contribution per unit [asi Variables [Solution Values] omy SS rn 8 X 5 7 > 0 a 18 0-174 17 yay Z, 8 To -10 2 7 ; =a G+ Contribution per unit 1 [Basie Variables] Solution Values 3 S1 8 %i 175/17 H 0 0 3A? F 4 Xy TNT 0 -1 1-7 any Zj 1688/17 8 4 4207 —sen5 G-Z ~20/17 Since all C,- Z; < 0. The optimal solution is obtained. 175 Rn RB 1688 Ans. Xie a7 Xoo Xan Om ay o> 7 7 FTA 0 LE 1. Why the “Simplex Method! is considered a general method for solving the Linear programming problems? What are various steps in the solution of a problem by Simplex Method 7 2. Write notes on (a) Slack variables, surplus variables and artificial variables. (b) Equality and inequalty (0) Decision variables and basic variables (d) Constant and constraints. 3. What is meant by ‘Basic Variable’ ? What is the function of slack surplus and artificial variables in simplex method ? 4. What is objective function? How is the form of objective function of a linear programming problem in simplex method different from graphic method ? How are the coefficients of Basic variable in objective function decided ? 5. (a) Explain why and how all relationships between variables and constraints are expressed in equaliy form in simplex method. (b) Explain how the inequalities of equal to and less than and equal to and more than type are handled in the simplex method ? What will be the treatment if the constraint is in the form of equation ? 6. Formulate a linear programming problem and explain the computational procedure for the same by simplex method. 7. What do the coetficients within a simplex table are represent. Why is it necessary to compute a new s* of coefficients for each table in the analysis? 7 ¢ 8. What is meant by degeneracy in a linear programming problem ? Explain the method of resolving degeneracy. 4 4 4 lex analyss? 9. What is meant by ‘key column’, ‘key Row’ and ‘key value’? How are these identified in simol Explain with an example.ext? Ho sich entans inhy na te 0 sin onip, vaviablos’, Basic variables’ Leaving yn -peason We ye ting. vaio iene during soon procedye » out Hom ar a of git optimal solution of a linear programming problem? fw en ‘mathe 9 ie on opti aon echo? ernie in ty yo co f ee +70) yer ye 70 Wag! gy 42a $100 : ayy tte £120 m20 (Ans) = 40,3920, Max, 2 $10 ah pnt OX 10, +30X2 ne yy 43K $35 siti! 5X; #2X $50 2X, + 6X) $60 XyXr20 Max. 2235 ‘here ea +4007 ad to Ska $200 ei ax +8Y £150 5X +4Y $100 ax +4Y <80 viet x20 (Ans, X=0,Y=2 Max.2-=800¢ 1 a. Z=80X+ 100 sitio X42 $720 5X + 4Y < 1800 ax+Y $900 vere X20 (Ans, X= 120, Y= 30, Max. = 3940 5, Mix 2 = 5X #3Np Sut to 3X) + 8Xy $15 5X, +2Xp $ 10 where XyXp 20 WM 2=3x) 420 Sikjctto: tay xy 40 atx <4 2x +3, $60 be wed (Ans.x}= 161278 Nas. Z6Max. Subject to: x +x2 $6 2x +3xy <3 xy s3 x53 Where xy x (Ans, x1 =3/2, XH=9 8. Max. Z = 3xy + 5x2 + 4x. a, Ze, Subject to 2x2 + 3x3 S18 Hl 2x7 + 5x3 S18 3x1 + 2xg + dng S25 Where xy xy 20 (Ans. x1=7/3, x) =9, y =OM 9. Max. Z=5X)+3X2 PK 205 Subject to Xi+X2 $2 5X, + 2X < 10 3X1 + 8X7 = 12 Where Xu X2 20 (Ans. X)=2, x, <9 M, 10. A manufacturing, company produces 2 types of product; the super and the Regula % Zs 19 Requirement for prot given below in table, Tere are 1600 hrs for arse G2? Ret week, 700 hrs. for paint time and 300 hrs. of Inspection. Regular customers will dema, ets ee 150 units of Regular type and 90 of the Super Type. Ind atleas, Product type Profit @) ‘Assembly Paint aaa Time (hrs) | Time (hrs,) ‘rae te Regular 50 12 0.8 02 Super 75 16 09 02 Determine the product-mix to maximise profit. (Ans. X; = 150, Xp =600,Z2 52500) 11. A company is engaged in producing three products viz. A, Band C. The following dataisavalse Products A B c Net Sale Price @ per unity 10 12 5 Cost (per unit) 6 9 10 The wholesaler whois responsible for selling to the Customeris to be paid ® 150 per day irespecive of the quantities sold in each of the products. The products are processed in three different operations. The time (hrs) required to produce one Product in each of the operations and the daily capacity (hrs) available for each operation centre are given as - Operations Products Daily Capacity (hours) A B c 1 2 3 2 400 2 3 2 2 350 3 1 4 2 300 What product mix would yield maximum profit and how much? (Ans. x=25, y=0, 2=1375 Max. Profit Z= 25 x4 + 0341375 x5 — 150=6375 per day)ES ONLY) ling sheet metal of two dif onaput relationships for the company ot so Waste Filing cans cabinets 6 0 etalA Gee er lo conte ry ue per unit of waste cans, fling cabin we correspond peste, £90 and % 20, respectively. There are 2 lence boxes a ey, A 0 of sheet metal Band 19, Unite gS She mea tc es 96 nventory, 30 ‘of manual labour Wheet'@lable inthe gis reverie 2 What MH =O 80, 7 gay \ 20X; + HOON, + 90X5 + 20x, ) Xi + ONp # 2X4 + 3X, = 225 (Ny + OX; + OX + OX; < 300 aX + 8X2 + 2X5 + 3Xy = 199 VX: Xo Xe Xt € 0) jos vo types of mitre chars and tales, The ony aie erby accounting, department are % 20 per chat an dts fr exh product as clon nee machines, My and Mand My Thetine required by ech produc ys frp pr week on each machine areas follows: y and tol ine al Tlachine Chair Table Available Time hous) M, 3 3 a M 5 2 50 Mp 2 0 tn shuld the manufacturer schedule his production in order to maximie contribution? (Ans. X1=3,X)=9, Max. i) i aso 2typesare available. Type A costs®8 per hen and type B 10 per hen, Type A laysonan avzage 4eggsper week and type B 5 eggs per week. Egys sell at 50 paie each The feeding cost of ‘peAhen is € 15 per week and of type B is 71.9 per week. Maximum of 180s tobe spent on purchasing hens. How many of each type are to be bought to maximise profit. Assume that it is ‘mipusble to house more than 20 hens at a time. (Ans, X; = 10,X3=10, Max.Z=20) § Teyaducts A, Band Care produced in three machine centesX, YandZ. Each productinvoltes {peationson each of the machine centres. The time required for each operation for unt amount teah product is given below : Machine Centres x Y z A 10 7 2 Products B 2 3 4 1 2 y (Time in Hrs.) Tee 10,77 and 80 hours available at machine centres X, Y and Z respectively Polperunitof A, Band Cis® 12, %3 and &1 respectively. a ccccceeen ee a _rvoo (INVOLVING SLACK VARaaay ‘ x ME16. 7. A small industry manufacturers OPERATIONS RESEp, rR —————ogramming Problem) and find the profiy problem as LPP (Linear Programmes "7 = 98118; X, Cem Formulate the > arket three items, A, B& C. The firm has yo) product mix company is considering to ™ rn x we A fond pr ents mixing, frying and packing, The time required for each Produce ‘sc theto al pvaiable monthly hours are as given below : ; — : Department Time (minutes) Product Mixing Frying Pala 1 A 6 12 B 12 24 ; c 24 12 6 5,500 Available weekly minutes 5,000 4,500 cls A, B & C is expected to be % 3,24 and 25 respective} Usin primum quantity for each product and the total profi (Ans. X; = 1000/3, X2=0, X= 125, Max. Z « 15 two products X} and Xz, which are processed in the machin in hours) required for each product in the shops ae gives The profit contribution of produ simplex method , determine the o week shop and the assembly shop. The time ( in the matrix below. Profit per unit is also_given along : Machine ‘Assembly Profit per unig Product X; 2 4 Pr Product Xp 3 2 4 Total time available (hours) 16 16 - Assuming that there is unlimited demand for both the products. How many units of each should be produced every day to maximise the total profit ? (Ans. X; = 2, X2=4, Max.Z=2) . XYZ company has three departments assembly, painting and packaging with the capability of making three types of almirahs. An almirah of type I requires one hour of assembly, 40 minutes of painting and 20 minutes of packaging time respectively. Semi almirah type Il needs 80 min ;20 min and one hour resp.; the last type requires 40 minutes each of assembly, painting & packaging time. The total time available at assembly, painting and packaging departments are 600 hours, 400 hours and 800 hours resp. Determine the numbers of each type of almirahs that should be produced in order to maximise the profits. The unit profits for types I, Ll and III are & 40, €80and 7 60 resp. (Ans. X,=0, Xp =200, X3=500, Max. Z= 46000) A furniture company manufactures four models of chairs. Each chairis first made in the carpentry shop and then sent to finishing shop. The man hours of labour required and available in each shop are as given below. Chairl | Chairtt | Chair! | Chair-IV Total available Carpentry Shop 4 9 7 10 6000 Finishing Shop 1 1 3 40 4000 Profit Per Item (%) 12 20 18 40 56000 =) ~ 4000 200 (Ans. X= =, Xp=0,X3=0, Xy= G-»Max.Z= 3are produced ona —X and Y are pro Paper machina Pape’ jan 400 tonnes of grade X and 300 tonnes of we nore troduction ours in a week. It requires. an gg be are ard Y respective ly with corresponding eroti OF EUS 0 produce one Ss oduct MIX: . : : S. a protjye manufacturing of pistons rings and values or whis .Z=0,Max.z = 200 73) ents for rings ailable for aon, preprat respectively: Determine desks, chairs, cabinet and book cas orkshop makes desks, chairs, 10 cases. The work i fansite WON ents-designing, fabrication and finishing. oo ajor dep: product in hours ° ii = equired per unit of i Chair a Department Desk ‘abinet Book case | Time available é 2 per week (hrs) 3 7 800 peignins Fabrication ae 6 ; 5 = Finishing : cGoperations per unit of the product is (&) Department Desk Chair Cabinet Book case j 15 3 a z poate 30 18 24 a Fabrication Finishing 35 28 25 1 Selling price per unit (%) 175 95 145 130 @ Inorder to maximise profits what should be the production programme ? @) Assuming that the items produced can be sold which Department need to be expanded for increasing profits ? Xp=0, Xj = 100, Max. Z = 8400) bees Z=2x +x Sujet to ee 2x1 $40 whereas Xx. =0 (Ans. Unbounded Solution) mA QUESTIONS FOR HOME DUST CS 21 Fe 4 May Subject to; Z= 3X1 + 4Xq + X3 X1 +2X2 + 3X3 = 90 2X1 + X2+X3 5 60 3X1 + X_+2X3 < 80 = 10, X2=40, Max. Z Xi, Xz, X3 20 (Ans. X1 = 10, X2 = 190)25. 28. CH Solve the following problem by Simplex Method Max. Subject to my Maximise Z= Too Xt % ‘ Subject to X1 + X2= 30,000 X12 6.000 12.000 (Ans. Xj = 18000, X2 = 12000, Max z 2460) An old car dealer wishes to stock up his lot to maximise his profits. He can select cars A, 5 and ¢ which are valued at wholesale at % 5000, & 7000 and 8000 respectively. These can be sold. % 6000, 2 $500 and ¥ 10500 respectively. For each car type the probabilities of sale are Type of Car Probability of sale in 90 days A 7 B 8 c 6 For every two cars of type B, he should buy one car of type A or C. If he has € 100000 to inven what should he buy to maximise his expected gains ? Formulate the linear programming problem & solve it. (Ans. X X2= 0, X3 = 25/2, Max. Z By means of some sharp bargaining with the union and subsequent reduction of union make work restrictions in his former contract, a small paper towel manufacturer has created come spare capacity in each of his three main production departments ; Cutting, Folding and Packaging For the purpose of identification, three different sizes of paper towel are called products A, B&C Owing to its small size, the company can sell in the market, all that it can produce at a constant price. Management is inclined to be conservative and does not wish to utilise fully the present spare capacity The paper towelling is received from another manufacturer in large rolls. These rolls are subsequently cut, folded and packaged in three sizes. The pertinent manufacturing and profit information for each size of paper towel is summarised as below : Department Size Constraint for time A B Cc period per week Cutting 10.7 5.0 2.0 2705 Folding 54 10.0 4.0 2210 Packaging 07 10 20 445 Profit contribution per unit in & 10 15 20 () Formulate the problem using simplex method.ad he OP imal profit Fi he optim yout! eae Ans. A. ies oc three eo Products viz, a, Bandc 200, .Ca1y9 1 Pron ely. The products are processed in three he profit ®)pe LM ) Perations viz, Pot Unit of pod each operation for each uni 5 rach uni red in Ls given belo operations A x 4 7 5 Z 1 ory works 25 days in a month, at the rate of 16 hoy, netgear process only HP di oassgatiecs gn Te ci achines The factory ha chines in operation X, 2 machines. get 4 beak down hie in operation Z. Find out the optimum product mix for units, ™ operation Y and one (Ans. x, = 9% 29 y _ 480 x. 2= 3X1 + 4X2 + 6X 7ST Mel) 4X) +Xp+X3 5 960 5X, +3X2+X3 < 640 X1+2X2+3X3 5 320 X1XoX32 0] xs Acompany is engaged in producing three products viz, A,B, C the following data are available: int. May subject t© Products A B @ Sale Price (per unit) 10 12 15 Cost (per unit) 6 9 10 Thewholesaler who is responsible for selling to the customer is to be paid 150 per day respective ofthe quantities sold of each of the product. The products are processed in three different operations. The time (hours) required to produce ate product in each of the operations and the daily capacity (hrs.) available for each operation centre are given next : Operations Products Daily Capacity A B c 1 2 a 2 400 2 3 2 2 350 3 1 4 2 300 Nhat product would yield maximum profit and how much. _ a8 (ans Xj<25.%220.%8 Ms Ze31. 32. 33. 34. Eg OPERATIONS RESEAR, CH ‘A Pharmaceutical company has 100 kgs of A, 180 ks of B, and 120 kgs of C available poy They can use these materials to make three basic pharmaceutical producyg, Mh 5-10-5, 55-10 and 20-5-10, where the number in each case represents the ereently weight of A, B and C respectively in each of the product. The costs of these rawy mage , a given below re Ingredient Cost per kg (2) A 80 B 20 c 50 Inert ingredients 20 Selling price of these products are % 40.50, 43 and @ 45 per kg., respectively. There is a q restriction of the company. for the product. 5-10-5, so as they cannot produce more than per month, Determine how much of each of the product they should produce in order to m, their monthly profit. (Ans. X; = 30, Xz = 1185, X3 = 0, M (Hint. Max. Z = 16X) + 17X2 + 10X3 Subject to X; +X) +4Xq < 2000 2X4 +Xq +X $3600 X1 + 2X2+ 2X3 $2400 X, $30 where X1, Xz, X3 = 0] apacity 30 kgs ‘aximise ax. Z = 20,625) A factory engaged in the manufacturing, of pistions, rings and valves for which the profits per unit are 7 10, 6 and 4 respectively wants to decide the most profitable mix. It takes one hour of preparatory work, ten hours of machining and two hours of packing and allied formalities for a piston. Corresponding time requirements for rings and valves are I, 4 and 2 and 1, 5 and 6 hours respectively. The total number of hours available for preparatory work, machining and packing and allied formalities are 100, 600 and 300 respectively. Determine the most profitable mix, assuming that what all produced can be sold. 10 200 7 [Ans. Pintons 5°, Rings = ~~, Values = 0, Max. Profit 733.33] Use simplex method to maximize m= 6X + 10Xg+ 2X3 [Link]: 2X +4X2+3X3 <40 X1+X_ $10 2X, +X3 S12 X1, Xy,Xg 20 Max. Z = 20x; + 6x2 + 8x3 Sub. to Bx, + 2xy +3x3 < 200 4x, + 3x. = 100 1 100 _ 400 2x2 +x3 $50 (Ansa 7a —A2(INVOLVING SLACK VARIABLES ony) oD x Mette problem table for alex . sim? geau the 3 . s rif? at 2xp + 3x35 0 {constraint for Operation —1 ve 0 a xy + 2038 60 (constraint for OPeration 2 3 ae! 2y4< 80 (constraint for Operation x1 %7 4320 pelo 0 0 ~1/3 0 ! 2/3 0 a -10/6 1 06 | 33 [> Se maximum profit and idle capacity. [Ans. X; = 10, x)= sot » X2=40, X3=0, Max Z=199 9X, +3X_- 2X) 35 4X, +2X_-X3 52 X)-4%) +X s3 X Xz, X3 20 , Mn blo (Ans. Unbounded Solution