an §. Two materials 4 and B are required to cor B nstruct tables and book cases. For one fio units of A and 16 units OLB are needed white for an le fora book case 16 units of A and 8 aisof B are required. The profit on a book cas ‘able, 100-units of material A ant : ‘cis % 25 and 20 on a table. 100 units of —eald £B are available. How many book cases and tables be produced to fave maximum profit ? jomulate this as a linear programming problem and solve by simplex method. (Dethi Univ. B.Com. (H) 2014) ‘Solution, Let x denote the number of tables and y denote the number of book cases produced. Then the mathematical formulation of the problem is : Maximize Z = 20x + 25y subject to the constraints: 12x + l6y < 100 16x + 8y < 80 xy 20 btoducing slack variables 5, and s,, we can restate the problem in terms of equations : Maximize Z = 20x + Sy +05, + 05, Subject to the constraints: 12x + 16y + 5 = 100 16x + 8y +5) = 80 X Ya Sr82 20 , 0 Mittal baste fos. =0, 5,7 100 and 8 ah “I basic feasible solution is: x= 0, y=0, 817 100 p = . . ion is Tableau I. O20. The initial simplex tableau corresponding to this soltion is Ta~ay Mathematics fo Baa, Mess Sig oad Simplex Tableau | ly 5 0 0 Basic ‘Solution 20 : ; Rp a Cc? ‘ Variable i + 100 12 (16) oe ToS 0 5 3 8 0 1 ‘ S, 80 iS 80g. 7 2 0 0 0 0 ty Z 0 a iti we must continue. The I; ite eeu Heese cease eet is the key colum * 25: Oy in the ceo we divide each entry of the “solution” column by the ‘Otrespong ae fey or ie Gey conan smallest nonnegative ratio is 25/4, 4 5, is the eae onder row is the key row. The key number, 16, is circled, Replacing keyang key rows using the technique discussed in Section 4.4, we obtain second tableay, "2% Simplex Tableau II ‘argest positive ent co Basic Solution 20 25 0 0 Ratio 4 Variable x » 5 Ss 25 y 25/4 3/4 1 1/16 0 257% 0 5, 30 9 -1p 163 Zz 625/4 7514 25 25/16 0 C-z 3/4 t 0-256 = Note that the value )~ 2 ent solution is not optimal and ve n Process. The entering variable 1s now x. The smallest nonnegative ratio is 3. Thus s, is the departing Variable and the key number, 10, is circled. Replacing key-and non key rows using the technique discussed in Section 4.4, we have Tableau mm. Simplex Tableau ti! o> Basic Solution 20 25 0 z J Variable ye 1 i. Se 20 - ‘i ; cee ten 10 z 160 1/8 20 2532 ir <2% 0 Oma aus Since all c, — 7 a yee ies j jon has © nities in Tableay Ul are zero of negative. ontimal solutionming—The Simplex Method pros i ; ad maximum value of Z is 160 which occurs when » = 3 4.15 rl a rollowing data are available for a firm which a. y=4, yt? Ti , Setures three items 4, B and (product aaa Required in Hours P 10 Finishing ae 4 4 2 80/ B 5 c 5 A 607 firm's Capacity 2000 rece 30¢ the above data in the form of linear programmin; ig problem to maximize the profit from 1d solve it by simplex method. [Delhi Univ. B.Com. (H) 1983, 1993] eet an ysion, Let 1» 2 and x, denote the number of units of items 4, B and C produced by the se Tien the appropriate mathematical formulation of the problem is : - Maximize Z = 80x, + 60x, + 30x, subject to the constraints: 10x, + 4x, + 5x; < 2000 2x, + 5x2 + 4x; < 1009 Xs 4 20 limducing slack variables s, and s, so as to convert the constraint inequalities into equations, tegiven problem can be restated as follows : Maximize Z = 80x, + 60x, + 30x; + 05, + 053 subject to the constraints: 10x, + 4x2 + 5x3 + 5) = 2000 2x, + Sxy + 4x5 + 5 = 1009 Xs Xpo X31 Si 82 0 Teint « ‘ital simplex tableau is Tableau I. Simplex Tableau ! rom 0 Ratio Basic Solution 306030 Variabl %. x, Ss 2 D : * 29-200 5, 4 0 d 2000 4) o 1 1009/2 Sy 1009 2 5 a 0 0 0 0 0 7Mathematiey Sor By Alo Nets i iable, The wd, 2, vow reveals that, Is the enn ‘anlable, a finales "Ohne | OG) = 10 s eparting variable and the pi! ne, A look at the Ss Ntatamn is 200, s0 5, is the Sed il Nd the key ee row operations, we get Ta 5 cltvled, Using. a Mb i, Simplex Tableau I “Basic Solution 8060 4 Variable x Note that the value of the objective function has been improved fr there i : i ‘OM 0 to Tow, hence the cu ng key-and Non-key Tableau II, fs Simplex Tableau Ml co Basie Solution 80 0 0 t Variable x, x x 5, 5 80 x 142 1 0 3/14 5/42 -221 60 xy 145 0 1 s/7 -1/21 5/21 Zz, 20,060 80 60 60 20/3208 Zz -30 20/3 -205 Zeto or Negative, Optimum solution has been +h occurs wi hen x, = 142, x, = 145 and Solution, This Problem, is of Stand, the nd 5 rd form, By introducing slack variables 5 5:¢ Simplex Method min _—Th ted in terms of equations : 4.17 pe reste = 4x +5Y +05, + 0s, + Os, were the constraints: x+y+s, = 20 xt 2y +5) = 35 x-3y+s = 12 20 % Vs Sts S29 83 ‘ic feasible solution is : x=0, =O 5,=20, $,=35 and s=12 jl B85" yo 7 we obtai in a sequence of tableaux that leads to the final soluti lution. esi this solution, ( Basic Solution 4 3 7 45 OO Variable = : 0 cena 5 5S; S, 0 s, 20 1 1 1 r 2 35 20 ; ‘i Om i 0 «35/2 0 5, 12 1 a 5 ° Zz, 0 0 0 i 7 = 6-4 4 st 0 ° 5 0 5 5/2 G2) 0 i a 7 = 5 y 35/2 1/2 1 .o om 5 0 5 129/2 5/2 0 0 32 aaa Z 175/2 5/2 5 0 5/2 0 C-% er a : a 1 0 2 -1 0 ’ y 15 0 1-1 1 0 +: 52 0 0 ase ot 1 Zz, 95 4 5.3 1 0 Shag G4, 0 0 =3 0 atthe ; “stig tml 4 i row of last tableau shows that it is se to further increase the lok ng ion. Hence the optimal solution is x ~ y= 15 with max Z= In |"dibeg arele 7, one may wonder why no quotient is vecsidred inthe sy- row of the ® baste feaeibie solution for this tableau is ¢ x0, y=0, 5,=20, 735 4 ae increase in y, the the | ea sible solution sinc held a ps can we incr’ it follows that Ne “ing Vai “ able is nthe new basi Sand 3 ope NOW by how much ca the initial simplex tableau,~y Mathematics Sor 2usin, ey ad 2-y, 5 =35-2y and sy= 12 +3y Md, cin $352 and y> 4 4 ive, we have y S20, y < 35/ Y2~4. Hence Since 5), 5 $5 eas ~ 4 has no influence in determining th mae at most by 35/2. The c¢ ing . . lax Meta. the quotient 12/(— 3) = — 4 is not considered in Sy row, Mum ing. : is why the qu in y. That is wi been developed in this secti . implex procedure that has on apg ies nming robles of standard form, other forms may be adapteq to fit tis lg program illustrated in the following example. imi: Z=2m+x, “x4 le 8. Maximize ; fan subject to the constraints: A+ <1 % — 2x, - x, > -2 %p sy 20 Solution. This is a maximization problem in which the Second constraint 4y~ 2x) - x; > 2 has the inequality symbol >. Thus this is not the s1 tandard form of a However, multiplying both sides by-1, we get +t <2 which is in the standard form. Thus, although the given Problem as stat 0 a ed is not in stand fom, it can easily be modified to Put in standard form. Now by introducing slack Varies and sz, the problem can be restated in form of equations : ' Maximization ro Of this constraint Problen, Maximize Z = 2x, subject to the Constraints: #32 — 25 +05, +05, Mts, 21 TH+ 2x +25 4 5) = * 2) 3,5, 5) > 0 An initial basic feasible solution is : Starting with this Solution, we obtain athe Simplex Method min 4.19 em : pres Simplex Tableau II win C,— 2 POW are zero or negative, optimal . entieS in ei i , optimal solution has b . jue of Z is 2 which occurs when x, = I, x, = 0 and x, = ae obtained and nt go? es val akes three types of furnitur i rm m: res, desks, chai yt Ang these items: However limited availability ee et avooreed el : ion. Data ‘ , labour and ie restrict production. ‘on usage of resources, supplies and profits on items are ato! ; § Desk Chair Bookshelf Supply sine sit 5 4 5 1000 hrs jar est 5 3 3 650 hrs, rirapce sqftunit 9 6 9 1260 sq.ft (tribution Tunit 270 144 225 (Formulate the above as a linear programming problem. (i) Using x, X59; 8 the respective decision variables, simplex algorithm was initiated for the above problem. At one stage, the following tableau was reached. G7 Basic ‘Solution 270 144 225 0 0 0 + Variables x x, x, s, 5, 55 mx 125 in 88 rr) $ 4 25 oe 88S o : 55 135 0 3 27/8_—- 948 0 1 C-Z, 0 9 75/4 - 135/4 0 0 whet . E ° sig the above table gives optimum solution. If not improve it and find the optimum itional labour force, the fi Th itn i iting additior men Semel Manager of the firm clair that by recruiting Inbour free ieypgrnaes mnereasedl ASSUnIIDE Es iigher changes, is the claim valid 2 Justify Y Jation of the given problem is: Total profit Sion 0 4 225%33 is a appropriate mathematical formul ace Z = 270%, + 144%2Mathematiey Sor "ng, . 4.20 ty, he constraints: 8x, + dx + 5x5 : asa le subject 10 5x, + 3X2 + Be Ss 1260 Space Const : “se = ~~ a0 St iven table can be represented as a os 7 - hon 7 Solution 270 : x, 7 oo zt Basic Variables Solution Since ali entries j . imum solution of the above fable are zero op Negative, aes = 100,70 eN obtained Maximum vaty °F Z is 36,000 Which occurs when 1 nd x, = 49, (i) The Slack ion coli lution cola labour PoMstraint. As seen from i a ise. TS Abour force has not been fully Our force Will not aim is, therefore, not Exampy son ion. The pe change the ©Ptimum solution. Thi 7 Valid, in his oF but coi OA compan Kinds of boats ty ga BE made profitably i Ut corny y's thly Produ is co, Tews aVailable h month, i his reve B bour, jit strained by the limited amount of ae that max he inform t® ditector Will choose the Combination of bo: * information Biven in th follawi-_ahe Simplex Method ot 4.21 Typet Bype ll Boat ie Type Ill a fonthly Boat Boat Availability 9 22 16 1260 Hrs. 4 19,008 Sq, feet 396 kes. 4000 2000 5000 ‘olve it by simplex method, From optimal table answer th er the Foye tte er ta a) poats of each type will be produced and what will be the resulting maximum Ww o\ \' ree? 7 a iis if any, f the resource IS not fully utilised. If so, how much of spare capacity is which é Al much wood will be used to make all the boats in the optimal solution? [Delhi Univ, B.Com. (H) 2001, 2007| Y i" How denote the number of boats of Type I, Type II and wai Let xy, ¥, and %3 en F . jell respectively’ Then the appropriate mathematical formulation of the problem is = Maximize Z = 4000x, + 2000x, + 5000x3 Total revenue | subject to the constraints: 12x, + 7% + 9x; < 1260 Labour constraint 22x, + 18x, + 16x, < 19,008 Wood constraint 2x, + 4x + 3x3 S Xs Xp %3 = 0 396 Screws constraint TN variables s,, 5, and s3 5 method, we introduce three slacl lagle the problem by simplex mulated as follows tutte given problem can be refo Z = 4000x, + 2000x, + 5000%3 + 0s, + Os + 053 +5, = 1260 = 19,008 Maximize subject to the constraints: 12x, + 7%, + 9% 22x, + 18x2 + 16%3 + 82 2x, + 4x +33 +3 © Xp Yas XS S25 53 bis: ial basi basic feasible solution is : = 396 tg 450, =0, 45 =0, , = 1260, 5) =19,008 and $3 ; With this | solution. 2 final solution, we obtain a sequence of tableaux thet Jeads to the fi4000 2000 x. Y Variable 7 5000 F ion C> Basic Solution 1260 2» 18 ° s, 19,008 ly Ny Shy 4000 2000 soot 7% 0 FN i +h 0 5, 16,896 34/3, “10/39 0 V v6 28344 5000 x 132 213 413 1 0 9 3g G-z, 2000/3t -14,000/3 » 9 0 9 ~s0003 4000 x, 12 1 5/6 0 1/6 0 -1/2 0 16,760 g 35/9 9 -179 13 5000 x, 124 0 17/9 1-9 9 23 2 668,000 4000 55,000/9 500 1000/9 0 4000/3 oz, 0 -37,0009 9 =1000/9 9 40013 Since a tries in C- Z,tow are Negative or Zero, optimal solution has been ere © maximum value of 7 'S 6.68,000 and it Occurs Whein x, = 1, X= 0 and x, = 124 The presence al simple sus * table indicates that the second resouree, fully Utilized, Ty fact, th js 16,760 © Spare capacity of wood left is 16,7 19,008 16,760 = Example IA p firm Manufacturin Tearding Tesource Consu; on : ag inform ing in! ‘ Ice furniture Provides you the ee ™Pption and availability and Profit contribution : Usage Per Tinie