Chapter Introduction NomericaL PRopLems, ‘A noadle manufacturing company produces the fallowing data for fccal the data: Oa Labew 12015, in soference to Capt gmat ceprcstions Calculate partial and total productivity ‘as: Yes ttl cat before Rs 68 per har andaftr Rs 48 bur) 2 Kacthamandap Manufacturing Company hac provided the fallow ig data, Dupe Sala vae of poaicion Rewmaterl ant suppes Capt equpen deprsatons (Compare the labor, aw materials and supplies and total productivity of 2075 and 2¢ 43,268; Raw matiasandsuppies 297, 291; Tt pretty 1.11, 087 as Ey Pata pony aber 28 268 Faw maori aed suphes 237 29) Feaproducity i | CConcluston: The labour and raw mateials productivity ofthe company has increased in 2076 tha it. 207 (ace period) but the otal productivity of 2075 is beter then 2076 te because the high capital depreciation snd anscollaneous expences in 2076 than in 207, oChapter Product and Service Design _Nomzricat Propuens 1. In the post office, customers arrive in the ticket wrindow is 10 per hour. The service rate of the window is 15 customers per hour. Find the probability thet (a) the employee in the counter is idle nd (b) customer arriving has to wait for the service ‘as: 0:33, (00.887 Arrival rate = () = 10 per hour Service rate = (n)= 19 per hour (a) Probability that the employee in the counters idle (©) Probobilty that arriving customer has to wait fer service “s 3 2 Am automated car washing system has «Poisson arrival rate of cars per minstes and the machise tas the constant weshiog speed of 6 care por win. Considering the consaat service rate single hansel model determine (@) Average mumber ofcar in quese (©) Average number ofcarin © _ Average time acarspenton queue. sa 0.087, 0) 133 6) 0.107 Here, Arcival rate cax/minate (@) Since this isa condition where servicerat is constant thus average number of carin queue given by Hos Tho (©) Average number of car in zystenn 0667 (0 Average time acar spent in queue 4 serPRODUCT AND SERVICE DESIGN CHAPTER. 3 3. Ina service department, on an average one customer arives every 10 minstes. Ithas been found that teach customer squires 6 minutes tobe served, Find out: (a) average queue length (©) average time spent in the system (©) tralfic intensity ‘ns: (910.91 castomert) 15min 06 nests one sc « Mean service rate) “2+ 10/nour =) §)- (@=) (©) Average time spent in the system (Wi) = (9) Average queue length (Lq)~ 0.9 1 customer + 60=15 min. ©) Teatcintensity 6) ~4 = 35-06 4. the arrival of customer for service is 10 per oar andthe average service rate is 12 customers per bow. (@) _Whatis the probability that theve are 5 customers in the system? () Find the lengthof the queue? ‘na: (010.07 114.17 ~ fosstonere FsouuTong ‘Customers arrival ate (7) * 10 per hour Average service rate (a) * 12 per hous ‘Probability that there are five customers in the systema 6-6) 0-69 Oe (-% = 4.17 «dcustomers 4 Length wee (bq) == 5. _A person repairing radios finds thet the time spent on the radio sets has an exponential distribution. ‘with mean 20 minutes Ifthe radios ase cequied in the order in which they conte in and their arsival 4s approximately Poisson with an average rate of 15 for S-hour day. what i the epairmas's expected fle time each day? How many jobs are ahead of the average set ast brought in? ‘ns: 0376, 108 Smt 2 pS =a pernour 7H apes 1st robeittyetaecutonwe “f= (1-2) <1 BE -aa75 Iie tine exch day = 0375 x83 hows 1s =D “HS= 1a” 6 On the avernge 96 patients par 24 hours day require the service of an emergency clinic. Also on the average, a patient requires 10 minates of active attention. Assume that the facility can handle only fone emergency ata time, If this situation satisfy all the conditions for apply queuing thecry, find the tverage (expected) quewe length and the waiting time forthe patent to be served. os: 133,20 nines wy 104 CHMDTERI SOLUTION MANUAL TO OPERATIONS MANAGEMENT FSo.uTong 6 ans pertour “Tea Lak 2 7. Avredio machanic on an average fines 5 customers caning his shop every hour for repairing thet radio sets. He disposes cf each of them within 10 mites on an average. The asval and service time follow Poisson and exponent distribution respectively. Find (0) The proportion of tine daring which his shop remain empty. (©) The average numberof cestomer in his system. (©) The average tine spent by a customer inthe queue anc the service as well (@) The probability of finding at lest one customer in is chop. (©) The average time spent in the quete by a customer as: (0.17) Scstme 0 mi) 50 mi) 416» castor = S customer / howe a 1 } nouss =} 60 = 20 minutes 2, 2210 min = {8-6 perhour oy ° ° ® 8 Ina single channel queuing model with mean arrival rate and mean service sate of 20 and 50 per hour respective, find (@) Average number of customer waiting in the system and quewe (©) Average time acustomer spend in system and quewe (c)_Probsbilty that there ie no customer and 5 customers ia system. ‘as: (0.267, 0.287)? nin, 08 se.) 08, 00081 = A =20perhour ° ”PRODUCT AND SERVICE DESIGN CHAPTER. 5 © en p35 OS 2)" nex (2) non (2)'-06(@)-oma 9. Acenain petrol pump ina big ty, customer arrives ina Foiston process with an average tine of tinue brent srtvale The en lnervalebatwosn services atthe pte pump fallow exponential istration and as sich the an tne ukento sedacea unis minates (e) What would be the expected average que length? (8) What would be the average number of customersin the systnn? (©) Howlongan erage customer does waitin the queue? (@)_How auch tie an average customer dove spend i the syste? A: 0.287) 0887 e}DO22N (= 12 ne COSSow= 3.0 ia Su Here, comin San aan cuteer rv rtp how) cnt ound sity by, S212 cutonue pero (ter er eel ae 9m now mean ara a perhouris 3 0) Meansevce rate (n) 4x60 =30 customer /hour (0) Expected average queue length (bq) = (©) Average number of customer insystm (Ls) 2 (2) Average waiting ine of a customer in queue (Wa) web (G5)-8 (an) -eonte 1.38 minates) (8) Averoge waiting tine in oyetem oa wee acusshowe (858 ni) 1D. Workers come toa tool store room to enquire about the special tools fora particular job. The average time between the arrival ie 60 second and the arrivals are assumed to be Poisson distribution. The average service timess 10 seconds, Determine (@) Average queuelength. (©) Average lengthof non-empty queue, (@) Average number of workers inthe eyztem (@) Mean waiting time of an seriva in quewe (@) Mean waiting time in system. ‘na: (1.333 err) 3 wore) 2 wore) 1.333 win 2 = Here Average time between the anivals is © second (2 minut), Now, mean areal sate (2) = 60 customer/bour average eves 0 cod (657 ein) y= 60 = 9 cuts ows Nov, oe (2) Average queue ngth = 5 EO a (2) Average length of nonempty que Lg) co techs ge) worker‘Ans: (0.187) 15 secant CHAPTER] SOLUTION MANUAL TO OPERATIONS MANAGEMENT (9) Average numberof worked in system (Ls) (4) Means ine in guns) iG) 1a 1 G4) Mean wwaiting time in system Wea 25 = pag = 35H 0.8 hour = 2min W, yt) & (ig) -sSpromnonr- 39min Hari Thapa found that the arrival rate of customers is 40 per hour and hie service rate is one customer on every half minutes, Assuming Poisson arrival rate and exponential service rate and single channel quewing model determine: (@) Average number of customer in queue. () Average time acustomer waits before he is served, (2) Average time acustomer spends on the service system, (4) Utilization rate (@) Probability that no customers ase in shop. 0.333 (¢)0867 Now, “Arrival rate of customer i 40 per hour Le, = 40 Service rateis given as onecustemer on every half minutes ie. p= 120 custome: /hour (@) Average numberof customer in quewe is ao 1600 sey Lan Guay "HW aso ww "Tao 9 ~ 0467 (©) Average time a customer waits before bein served 1-8 (ets) ie Ani) "a28 (100-00) "Tae a0” MM hee 1S sano, (2 Average time customer spends in service system 11d wy Sp—T5 "35 70013. “45 second 240 () Vitisaionrate ES 0.385 (@) Probability that no customer arein stop, 2, 8 ase Peat 07 0667Chapter 4 Locations Decision and Facilities Layout _Nowzricat, Proptems 1L The fixed and variable costs for dee potential manufacturing plant ates for a leather product production company are as foo ‘Ste Fiedeost 5) Varese praia 8), Varibin sso perontn) | Teuleowe in8 CHAPTERS. SOLUTION MANUAL TO OPERATIONS MANAGEMENT From the calculations we can conclude that, Volume ge Lawestoost beton 0 125ente Siok 1262s see (©) For production of 200 unit, site B provides the lowest cost location So, ste Bis best 2 A multinational company (MNC) is planning to establish a manufacturing plant for its products. The ‘MNChas selected following sites fer the production unit. ‘estes Fhe eos Vorb ons poo Ra a “200 7 c 16000 2 a. Graph the total cost lines 'b__ Fora production of 600 units which loction will be the best? Bowron (@) Graph of total cost ines: O| bo ate sto do sto cto oho Unit of reduction (©) Fee the production of 00 units: ‘otal cost for location A ~ Fxed cost + Variable ost = Rs. 2500 + (7* 600) ‘Total ost per locetion B = Re, 700+ 5 600 = Rs. 10200 ‘Total cost for location C ~ Rs, 10900 +3 « 600 = Rs. 11,800 A600 units botwean haz the lowestcoct 22 tis preferable, 3. Chuck Bimmerie is considering opening a new foundry in Denton- Texax, Edwardsville-linois, Fayettville-Arkansas, to produce high-quality rife sights. He has assembled the following fixed cost ‘end variable cost data, Lasso, Fiedler pee Tine Tater Contaad Deron 200000 120 00 wa Eaneririle ste 000 2s 075 07s Faye s1m000 $100 $100 $100 Graph the total costlines. b, Overwhat range of annul volume in esch facility going to havea competitive edvantage, Whatis the volume atthe intersection of the Edwardovlle and Fayetteville cost ines.LOCATIONS DECISION AND FACILITIES LAYOUT CHAPTER 9 FSo.uTong esaion Find cost Vari oe ‘Derr 200000 Esuarscile s1e0000 8175 Faye smmoro 2 Hee, ‘Variable cost = (Material + Labour + Overhead cost) (©) Let x be the annual volume, total cost equations for each location s sonore masonite fs Le song or dt song oan) “Solon Santo Thon 1oaes race ox, ipo anon chon cx, tse roo commen fe ton -123 1 uecesruts 2-98 nis tangt au, tae Best ation 0% ete Sor ser — Einae (The volume atthe intersection ofthe Edwardsville and Fayetteville cot line is $000 units 4. Use centre of giavity method to locate the new location of «company which has these existing plant locations along with the co-ordinate distances and loads Lesion Cesena ition in lonetr Tod fo) & 25) 10 3 (at 29 200 oes 1200 ‘as: Cr TT Oy 318 FSoLuTong By using centre of gravity or centroid method te determine the best location forthe new facility. yx=20 ay=25 ax-10 ay-30 ax +18 ay =37 Wehave a2 127.000 | See gv, 4000 ~ 519 Since the centr of gravity points (161, 319) So the invesor should locate his/her company in the vinicty cf the centre of gravity (12.16.1319) Alternatively Lesa Cocranam aenees 7 rey ma A 20.25 1000 00 B00 5 (10,20) ‘200 20 35000 © (837, 1200 32300 600 a0 4400 | 1270 Using centie of gravity method Location of mew company: xe Sasa “200010 CHATERS SOLUTION MANUAL TO OPERATIONS KANAGENENT 1.27,600 ve Co-ordinates of new location (163, 31.9) 5. Detennine the placement of departments for a newly designed facility that will minimize tot ‘wansportation costs using the data in the following tables. Assume that reserve distances are the same, The locations are shown in the grid. Use acost ofS per trip var leeaten A er cesta citer Distance between locations (Yards) x = c x 7 @ ‘Numnter of Trips per day between departments 7 z z i 2 a ne: Teal Cat 617200 = Fiat sank or arrenge the umber of tips fromm high te love. Deparment Narter of tes 7 0 ry 0 4 5 23 2 [From this we can soe that departments 2and 4 have the grestest interdeparimental work ow, wo they should be dose, peshaps locations C and B. Next, we can ave tht the work flows for 1and 4,and 3 and 4 sxe high. Therefore department 4 has to be located a acental locaton (locaticn B), while department 2s ‘location department 118i location A. and department 3 3sin location D. ‘Distance’ Number of trips matrix Departner 1 2 7 + = (Wore0y=e00 | GbeTo)= nO 2 = = (a0 x60) = 0 + ‘otal ont = S450Chapter Linear Programming _Nowrricat. Prontens 1. Solve raph theolloving LPP thee 2028 0 be mac 2266 7% eae eae pore tat NEO e Mnze des. 4 Sabet Bes weec216 wt ROO ett perce sad X, X20 ‘ns: (i}Z = 10(0)X0 = 19 5,X= 15, MaxZ = Bs 91.60 Mp opinl olin xt Us (eZ = 200 Rs 286.71 aX: = 66/7andX: = 307 (gC = 2088) = Rs. 160305» 4, and Xs = 2 (The gven linear constraints are Mir Des Mrks4 X,Xi20 ‘Then te corresponding near equations ase Xs DQ=5 a) MX Q) end X 8) UX: =0, then X ‘hus table of equation (1) given below x fo [5 x p37 [0]10 © CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Hence, poits(0,5/2) and 5 0) lie on equation (1) From (2), 12% =0, then Xs=4 X20, then X= 4 “Thus. table of equation (2) is given below x [0 [4 x [4 [0 Hance pourts (0,3) aad (4,0) lis on equation (2) for determination of the plane regions of the both linear constants, we use test point (0,0). Put X;=Oand X;=0inX +2455 ox, 03 whic ste) Hence, the solution Se of X; + 24; 5945 the plane region conta the origin Put X;~Oand X:~0inX +Xi<4 orosa cx 04 whichis true) Hence, the solution set of X; + X;4& the plane region contain the origin. Here, X; = 0 isthe Yonds and X;~ 0 2 the Xan. Az X, 2 D and X; 2 0, a feasible region lies on frst y ‘quadsant only. Here, ABC is 2 fenible region formed by given constiints. The coordinates of B can be obtained by solving fe bouadacy equations Xie Don sands 4 Subtricting equation 2) from equation (1) Xe Dees Kindend 1 “ Putting valu of X from equation (4) to quation (1) Xe 2e1 95 Xin d-2 xin3 Coordinate of B= (3,1) ‘Vortica of feasible region OABC ars (0,0) (05/2) (3,1) and (40) sexpactvsty Calculation for maximum value of Z a Feasite soiations =e BaBE 00.0) ° ° Z=de0saxord 400,5/2) ° 5/2 Z-2604+445/2-10 83.0) 3 1 Z=2%3+4"1=10 cao) 4 ° Za2e4+4x0rs Fromabove tbls wehave Maximvam value of Z = 10,.when X; ‘The given linear constraints axe Ker Xie Kress Xe XPO ‘Then the corresponding linear equations ae Xi-Xr a a) Xt SK 18 Q) and 70:70 8) From (1), UX. =0. then X= -12 UX: =0, then X,= 12 =OorSandX:=5/2 10 LINEAR PROGRAMMING CHAPTERS 11 ‘Thus. tableof equation (1) is given below x [ o | 2 x |=? [0 lence the ine ¥; ~~ 12 passes through (0,12) and (12,0) From (2), 1EX: =), then X= 6 1,70 then X= 18 ‘Thus, table of equation (2) is given below Xe 18 x [« [0 Hance the ine Xj + Sig ~ 1S passes through (0,6) and (25,0), For the determiration of the plane region cf the both linear constraints, we use lst point (0, 0). Put X;=Oand X:~0inX- Xs 12 o-0<12 0:522(oehic is rue) Hence, the solution st of X;~X:< 12s the plane regon tewards origin. Put Xj Oand Xe 0in + 3% <15 0 18 whith is rue) Hence, the solution set of X;+ 3X2 $ 18 5 the plane region towards erigin Hoare, X; ~ 0 is the Y-axis and X; ~ 0, feasble gion lee oa iret quadcant only Here, ABC is a feasble region formed by given constants ‘Then points of intersection of equations is calculates a follows: Subtracting equation 2) from equation (1) MGR Xr g—18 e= 6 Xon3/2= 15 Mee X= BS ¥ 0%) = 035,15) From ahove graph, the vertices offensible region ABCD. Calculation for maximum value of Z (0,6), (0,0), (22,0) and (285,15) soepactiaty Vertces Feasible solutions pone AOS) 0,0) 12,0) x qa, 15) a Tromabove table wehave Maximum value of Z=915, when X;> 133 and; The given linens constraints ace 419X616 2+ Xe £100 end X20 cooly = . Z=6x02 706-0 0 Z=6x0+7*0-0 02 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT ‘Then, the corresponding linear equations are 6X.+ 19X2= 216 a) 2q+q 7100 @) and % 70X70 8) From (1), I1Xi=0, then X¢= 12 1960, then X= 36 “Thus, tableof equation (1) is given below x | o | 36 x |» | o lance poiats (0,12) and (3,0) le on equation (1) From (2) LEX; then X:~20 UX20, then X.* 50 ‘Thus, table of equation (2) is given belowe x | 2» | 0 Rance, poits (0,20) and (29, 0) le on equation (2) Tor the determination of the plane region of the both linear constraints, we use test point (0). Put X;*Oand X:~=0in 6K; + 9%¢5216 o+0sa6 0.2216 (which is true) Hence, the solution set of 6X; + 18X; 216 isthe plane region contain the origin, Put Xj Oand X:~0in 2%; + 5100, 05 100(which is true) Hence the soliton set of 6X; + 18%; 216 the plane region containing origin. Here, X; = 0 isthe Yeaxis and Xs = 0, isthe Xoanis. As X; 2 0 and X:2 0, a feasible region ies on first quadeant aly. Tor point of istersetion multiplying = Y equation (2) by 3 an subtracting from ‘squaton (2) 0% H19X= 216 0 +15%~ 300 From equation (2) 2-100 -3X o Xe=100-9-25, ez, %=100+140 or, DG =240 X= m0 [Representing above data in graph Calculation for maximum value of Z Fossil solutions Vertices < = ZnO AOD ° 7» Z=Ix0r oa 134600) 20 ° 2250464 0~100 00.9) ° a Z=2%0+6x0-0 ‘The maximum values 120at = 50 and 3@ © LINEAR PROGRAMMING CHAPTERS 13, ‘The corresponding equation of boundary lines ~) 2 =) a) From equation (2) 2X;- 2672 mf o [4 x [1 [0 ‘Taking testing point @, 0) in 2X: 2%:22, we get 240-2402 (als) So, the graph of 2X; ~ 2% $ 2 is the plane segion doesn't > contain the orig Again from equation (2), 2X5 + Xe =8 x | o [4 x [a [0 ‘Taking testing point (0) IX + 2X2, we get 240+2020(face) So, the graph of 2X: + 2% < 8 is the plane segion doesnt contain the origin. From (2),X/" 0s the Y-axis From(3).%)= 05 thexaxs X_2 Cand Xs >0 means we have te consider the region in first quadrant oaly. From the figue there i ao feasible region so it is ‘unbounded solution. ‘The corresponding equation of boundary lines 2+ k= 50 A) 2+ = 100 =) %=0 8) xan0 oa) fom equation (2) 2+ Xo x | 0 [35 x [so [0 ‘Taking testing point @, 0) 2X: + X50, we get d+0s50 0 50(true) From equation ), 2X; + 5% x | o | 50 x [20 [0 ‘Taking eoting point (0) OX, + 5X = 100, weget 0+0<100 0 100(tre) 50, the graph of 2X: +X: £50 and 2X:-+ 5X: < 100 both containing the origi From (2),X,= 0's the Y-axs From {3).X:= 0s the Xaxs X,2 Oand X; 20 means we have to consider the region in first quadrant only. For point of intersection, Subtract equation (2) from equation (1) e+e = 50 2: +5Xs=10014 CHAOTERS SOLUTION MANUAL TO OPERATIONS KANAGERENT 2850 -% 2qn30- 25 mens, Ka 1875 Bas cx187s, 128) From figure AOBC is the feasible region where the coordinates of AOBC are (0,20), 0), (25, 0) and (18.75, 325) mepectivsly, ‘Vertices Value of 2= 0s + 0X ‘A(0,20) Z=4=0+10=20= 200 (005,0) Z=4%25+10«0=100 B40) Z=4x0+ 10x00 o1s75,125 | z-4%1875+10«125~200 ‘The maximam value is 200at A(, 20) and C(1875, 125) (The corresponding equation of howndary kines SX HAAS A) Dirk 2) Xeno 3) dono =) From equation (2) 3Xi+ 5= x | o [ x [-s[-9 ‘Taking testing point (, 0) 3X; + SX.2 45 we get 02 45(fals) So the graph of 2; + 5X: 245; doesn't contain the origin. Again from equation (2). 2%; + X= 29 x fo [10 x _[ 20 [0 ‘Taking esting point (, 0) 2X, + X;620, we get 2*0+0220 02 20(fals) So, the graph of 2X; +X; 220; oesnttcontain the origin. From(2),%.= Oi the Vacs From (3), X= 0's the X-axs X:2 Vand X: 20 means we have to consider the region in first quadrant only.LINEAR PROGRAMMING CHAPTERS 15 Here ABC isthe feasible region is shown in graph Fer point of intersection, multiplying equation (2) by 5 and subtracting from equation (1) Okeke 49 10%, + 5X:= 100 “A 3S x 2 may =o revi offen ats 0,8 (2-2) 00,20 Value (C= Be 20% 15+ Re 30 *0> Re 500 2a inom (C= Re. 2004 Re 0x 20> Re. 600 inna ane Rescate (2.22). (© Theconwsponding equaton cf boundary a+ e120 =) 3X4 X= 120 a) xno 8) Xero 4) From equation () 4Xi+ 3%.= 120 = [0 | 20 x | 9 | 0 “aking testing pont 0,0) HAK.+ 3K.2 109, ee get 02 120(abe) So the graph of 2; + 54:2 120 dover contain the origin,16 CHASTERS SOLUTION MANUAL TO OPERATIONS KANAGENENT Again from equation (2), 3: + 6X: =120 x [| o | 4 x | 2 [0 ‘Taking testing point (, 0) in 3X: + 6X: 120, weget 3*0+6x0210 02129 (fabe) So, the graph of 3%: + 6X: 2 120 dosent contain the origin. From(2),X;= 0is the Y-axis From (3), Xi" 0s the X-axs X_2 Oand Xz 20 moane we have toconsider the region in fist quadeaat only Ter point of intersection, multiplying ‘equation (1) by3 and equation (2) by 4 then subtract equation 2) rom equation (1) 12K + 9X = 360) 12K + 24K = 400 == = 120 Xe 8 be -120-36 or, dey 120-3 «8 Kam From the figure ABC isthe feasible region. The vertices of feasible region ae A(, 40) B (24, 8), C(40,0)- ‘Vertes Value “Ai@.40) Creno+8x10=080 Bass) (C=6* + 8*8=208 cise. 8) C=6% H+ 8*0=240 The minima value B208at X= Band %=S (h) The corresponding equation of boundary lines + DOTS a %+ =D 2 eX 10 8) xno ® x20 6) From equation (1) Xi 6" 18 x | o [3 x [92 [0 ‘Taking esting point (, 0) OX, + 2 18 we get 6x0+4x0215 02 18(fals) So, the graph of + 4X 218; doesnt contain the origin ‘Again from equation (2), X:+ 4X2" 12 x | 0 | 2 % [3 [0 ‘Taking testing point (, 0) 1X: + 4X22 12, we get d+ax0212 02 12(fals) So, the graph of K+ Xs 212; doesn'tcontain the origin.From equation (3), 2%. + X= 10 x [| o | 5 = [30 | o LINEAR ‘Taking testing point (, 0) in 2X: + X22 10, we get 200210 03 10(fale) From(2), X= 0is the Y-axis From(3).X:= isthe X-axis Calewation for insu vale So, the graph of 2X; +X; 210; oesnttcontuin the origin. ROGRAMMING %_2 Vand X: 20 means we have to consider the region in first quadrant only. Vortices Valse of = Fa A010) 200 4010 = 100 34.2) 0x4 + 40x 2 160 (ein) oa. 8) 20=32+ 0-0-0 The minimum values 160at Xi= 4 and X= 2, 2. Solvefollowing linear programming problems asing simplex method 2 Maxiniza Z= 34, + 465 Subjetto X;+X2<20 D+ 50 wed X20 os MatZ = 70, Xi = 10,X2 = 10. sm Revised Simplex Method Introducing sick verable to comment into equations Max. Z =9Xi+ 4X: + 05: +05: Xi+X+5, 20 DK Xe Sy 50 Xu%B0 cHaTERS 17 From the figure ABC isthe feasible region. The vertices of feasile region are AO, 10) B (4.2) and C(2, 0).18 CHASTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT ‘Standard format fr simplex table i Row 0:2 3X,~ 4X; - 05, -05:-0 Row 102 ++ 2+ 5; + 05:-20 Rov 2:02 + 24; +32 + 05,+5:= 50 Simplex Table ® o - R 1 sa/1-20 R eos 3/3 =10/3 ‘Since Aas he highest ve valu, Xe colamn's key column. Keyelement=3 Rep R= Ried z 12 o21038 WR =) = Rep = NewRe[OMR - 1 = RepRi = NewR: a 2 GO em ys fa ea vs 2 em ere co fa a o a er oe 1 o = ee os = ys | 0-4 -us 0 ey es = ma | 10/3 Simplex Table Raw z = Baie & ee S x | Cech ~ R ° bal 25 ‘Since 1/3 has he highest -ve vale olan Rep R= Rex O41 03 oun + We > = Newh| OM ys Rep New 7 7 0-330 ° p+ ee 1 + 0 | we ws x 1 =O o + ys + 0 + 0 pose 0 = a of we 8 ad o x 3 2 2 woe ae alow ce ae a mas ye + wo - 7 | sss Simplex Table I Tow z % % = = Constant % 7 ° ° T 7 70 R ° 1 ° 3 a » R o ° i 2 i 10 ‘Since ll the cootficiants of the variables of Roof table Il are positive or 0, Us optimal solution has been arrived at Xin10, 20, Xi=10, 0, 2=70 SIMPLEX METHOD introducing slick virabes to given constraints Mas. Z=3%; + 4X XioX45, 220 Dy 3Ke 8 XM $1520LINEAR PROGRAMMING CHAPTERS 19 Simplex Table G Ratio Ww ° 5 wyi-m0 0 s SMa. z-0 2g) Most negative valuein Z- Gis Xzeohuenn is tay column, ‘Min, ratio i 50/3 2a! row is key 008. Key element i 3 Rio O1MR:/3 30/3 3/3 1 0 4/3 Updating Rs Ry + Old R,-New Rs Old Rs me 1 11 0 NewR: 50/93/31 ¥/ xe we ow 01 ap Simplex Table 9. Ratio ° Demin 4 6 i Negative value in Z,- Cron = Xzcolumnis Fey column, ‘Min ratio i 10 Rov. tis key sow. Key column = R-300R: wir 0 3 patig Bian, Fie oun A ys 1 0 inet, Be 3B bt Me ew 0 72 a BV x: 10 x 10 76. gj since Z-GE0 Solutions optimal Max. Z=70,X,= 10,210,20 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Be Mux. 2 400%, + 520%; Subjectto 4X: + 20% $ 600 ‘88,4 10% $100 ae Ree 38 and X, X20 (aa: = 13,%0 = 4) Man 2 = 9400 c Maximize Z= 2X, +3 subject to x7 2G220 10x, +20%<175 snd |X, X20 ‘as: teil Som Simplex Method ‘Adding slack, surphus and artifical (Gummy) variables, Max Z= 2%, + 3X5 = MA Subject to Xit K-54 =50 10x: + 20% 5." 175, XX SS ADO Simplex Tablese 1 S ° |. > Sa BV | Constant Ss [sa s. [a 7 >a o 15/20 Me ufo |o R, $Old R- 2RepRs ode | yaysfayoya 2mepR |3/2| 1] 2 | 0 |x| o New [e2[o[o [a [ayo] a Simplex Tableauit G 23 fo oat aa, BV_[ Contant [|e ua [sp Topo [aaa = 3 | x Pe xe [yo 3572 Zewiaee | an [3 | [wo] a ZG apo ox Taso | OR? 1 ape Simplec Tableau tT G zT3 To oo | -w BW [enter | [es fs a nate ufay, se fe]o a} az]2 2 |x] |i | 2 | o | ao | oo Zaamy2-s | 2 | 3 | M | wayo | ZG oa asso ‘Since, allZ-G & Oclation i optimal. Again value of A it appearedin the opticnal able Solution i infeasileLINEAR PROGRAMMING CHAPTERS 21 Alternatively Masimize Z= 2%: +3X: Subject to i+ 263.50 10%, +20X¢< 175. and XY X0 ‘Adeing slack ertifical and subtracting surplus variable = 2X, + 3X2+ O5;- 0A, + 0; ‘Subject to X + 2X-5; + As +08: =50 10%, +20X +05: +08; + 2175 XuXS Sus 20 Arranging the equation a: stardasd format ofineas programaing by simplex method, Re. Z-24-9 + 05; + 1A; +0570 Ry 0Z +X + -S+ A+ 0550 Ry 0Z + 10%; + 20X; + 05, +04, + 5 175, eX 5.5 420 Simplex Table Kew [Zz x x = a = ‘Constant Be 1 =2 =3 ° 10 0 ¢ R ° a 2 1 1 ° 3 & o 10 20 o o 1 us ‘Arranging for identify matrix Now Ry= Ol4Ry- 10(R,) Using this formula, new Re becomes Constant | Ratio = 500 : 175/20 Hier, Rep Re=R=20 0, % 1 0, 0, 1/20, 175/20 Ro-+ Old Rp +23 Rep. Re OuR: 1-12 wD 0 0-500 23 Rep. wr 2300/20 4035/20 Ee 1-0 02/20 1195/8 Ri + O1MR.-2Rep. Re Odk: 0 1 2 1 1 08 Repke 0 1 2 0 0 10 175/20 eee ea ae simplex Table Lit Ay [S| Constant [Ratio «| ao [=n [— 1 ce Hier, Rep. Re= Re" @ 2 0 0 0 19/0 Ry Old Re +12 Rep. Re OMe: = 1-H 0 DO -/10 - 1195/4, MRe-Rs 0% 1 0 010 -65/2 Re 10 1 0 0 M/s -%07522 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Simplex Table IV Rew |Z X X 5: Ar [S| Constant | Ratio % T ° 1 10 ¢ | as | 3075 R ° ° ° “1 i | -1/10 | 65/2 Re ° 1 2 0 “ ° 35/2 ‘Since all variable of Ry > 0, the optimum solution = achieved and the solution « Z~— 3075-0, X:~ 173, however, putting the value of X; and Xin objectwe function Z = 2%: + 3X we get Z=2%175+3 035.50 the solution is infeasible ‘Since value of Ais oppeaced in final table Solution infeasible 4 Maximize Z= 3+ 8G 5% Subject to 6X1+ 7X+ 3K 600 0X6 15% 29%2 500 XtX+% 250 and Xp XEO ‘as: Max. 7 = 1000 = 0, Xo 0.Xi= 200, $1 = 0 2 700, $= 160, BsoLuTong ‘Adding slack, surplus and artificial variables to given constraints Max Z = 3x: + de: * S~ 1042-10; oe Za3u~4g~ 55+ 1A TOA: Subject to 9X; +7X 43%) S; = 600 OX; 154+ 206-5; A= 500 Mee Xr hs =S+ ASH SO and XXX Sy S55 Av An AsD0 Revised Simplex Method Simplex Table Ss Ar [As | Const ° 10 | 10 o ° ° ° 60 a 1 ° x00 ° ° 1 2 (sR) = News (Ovo) ay = ey = ays +0) = cy = 0 oy + a+ = 0 ny = 0 oe mors) = -1500 Simplex Table i aug papalLINEAR PROGRAMMING CHAPTERS 23 no 0% % 10 -% 0 N 0 8 y+ Old Ro +85 New Ry Oldg 1 -3 #8 -33 0 «100-10 SSR 055/2_165/A_55_ 0-5/4 0/0135 Re 1-2-0 0 -15/4 10 55/4 0-225 Rit ORL 3 New R: ows: 0 6 7 3 1 0 0 0 0 6 BR 0 32/43 OH OS R 0 of wa Ot & OO 0 33 Rio Re-NewRy RB 0 2 2 20 0 2 0 1 5 NwR: 0 4 4% 10 -% 0 % 0 2 Re eu oo % 3 Simplex Table 1 3s | & [Ss] & | As | Cont | Ratio “5 [ 10 | ssa [0 | -1 - ux | o | sas | aser ie “| 9 30 Old Re: 1-1/2 -1/4 0 0 -15/4 55/4 0-15, u/2NewR: 0 _1/2_33/4_ Mo -mya_ 0 /s_ 023 Re 10H HO 13/2 033/20 150 9 Ks Old Rs-FNew Ke ours 0 92 wh 0 1 % 0 -m 0 5m 9/2Rs 0 92 «md 9 0 -9/4 0 9/4 0 225 Re ° : 300 Ri OWR-4NewR: old Re Oo 8 6 0 oO 4 me 1 Y2NewRs 0 4% % 10 -& 0% 0 2B a a a a a a Simplex Table 1V newl Zz] Ml“) |S | |S] A | AD | Cont | mato wpa] o [ave] u | 0 [fia] w | ova] o 0 = rn} of] o | -2 | -» ° 0 00 Ro ° ° ove 5 °24 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Ry Old Rp +13/2NewRy Old Re 10 1/2 MO -13/2 1 33/2 0 150 BANWR: 00-2 BOB? -B BR Bo Re + 9-1 20 0 -3 10 43 150 Rit OWR:-3NewR) oa © 0 -2 -9 2 3 0 -3 0 30 3New Ry: 0 0 -3 -§ 0 3 6 -3 6 0 Re oo 3 tO 6 0-6 300 Rs OURS +% New, our: 0 1 32 20 -&§ 0 & 0 50 NwRe 0 0-H 1 0 eto Rs ot a 70 0 a 0 1 50 Simplex Table ¥ Row Ratio Re = Ri %0 R -ve B = 0 0 6 -% 6 0 1 0-1 50 Ry Old Re+3New Ry oldR: -3 10 13 10 3NewR: 0 30-3 1 Re 1 0 10 10 300 ROR +NewR, NewR: 0 0 1/6 -% 1/6 0 1 0 -1 50 Owe 0 1 1 ° o 1 50 Re 01 7/6 & 1/6 0 0 0 0 100 Ry Ol Ry +2New Ry Re 00 ° 2k 00 200 Re 00 100 Row] Z Ratio BP = R | (o"] 200 x | o - 208% 0 2 7/3 1 1/3 0 0 0 0 20 Ry Old Re *FR (new) Ok: 1 0 -% -7/2 % 0 0 1 10 30 72k 0 7 49/6 7/2 7/6 0 0 0 0 70 Re 1 ~=S 28/30 5/3 0 0 10 10 1000,LINEAR PROGRAMMING itis fier cumpteRS 25, ours 0 0 We 4 ye 0 1 0 1 50 a2NewR: 0 1 7/6 oo ow Re 014 0 43 0 4 1 0 R-OWR +9 New Ra Re 0 0 -y3 -3 3 1 o 10 BNwR: 0 6 7 3 1 0 om) Re 0 6 BB 0 Ws a 700 ‘Simplex Table VIL Row [Zz] |] | & |s | & | A | A | Cont R® {| s [xs] o | 53] 0] 0 | 1 | 10 | 100 R|o| i fas} o |as]o}1 | o | -1 | 0 R|o| 2 | 73} 1 | a ]o}o | o | o | 2m m|o|o jiys| o | ws |i} o | -1 | o | mw ‘Max. Z = 1000 X= 0, Xz= 0, X= 200 5 =O, S:= 700, 5 150. fe Max. 2=X,-X2+ 3X Subjette X77 S10 BiXes2 DK-IK+ IK 6 end Xu XO ‘as: Max = IX: = 0; Xs » 246; Xs = 286 ‘Adding slack variable to given constraints Max Z=X,~X + 3a Subject to KPA TAG TS,A IO De Were? DDG + 3+ 5s XG SZO Simplex Table mow [Z[™]S[N[s] Constant | Rate x [1fa[1fs]o]|o 0 = 2 0 ° ove 2 2 2iol 03, F1.0,05,2 Ro OM Ry + Old Re om Ji; a]i)s,;°];o)],<«] 0 oan |o | 2|2/| 3/0] 0 6 Nes [2 [2 ]a])e]° 7 B+ Ol = RePR ode PO], aypiyiy. 7] 0 reper | 0 | 2/3 |-2/3| 1 | 0 ya] 2 Newk | © [we [53] o[ 2 aB[ 826 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Ry Old R, + RepRy Saxe] =e pape pa ye mpm || 222 | «| o | a or r fw 3 [S| eont | a % 2 . x = | as R 7 + fw 5 0 2 | RepR, +2 O1dR; 3 Ry 01d Ry + Rep Rs oan fa] a Repr:_| 0 | 1/3 sis|_o | -as| 24/5 wwe [2 [os] eo | o fas] o | a | ows 2 Re old + Zep Ke om fo | 5 a o | 2] 0 |-2r9| r6/> Beers | 0 | 2r0 news | o [ays] o | o fas| a | a | 30 By +014 B+ 2Rep om | oO] las; a]e,o lw 2 Nek [045] 0|12|25| 0 | 1 | 2 ‘Simplex Table It now [Zz] os [xe |u| s | s: | 5: | Constnt | Ratio RB [2] es] o]ofas| o fas] sus mn |olws|a|ofas| o |-ays| 2x5 rm | o/s] o | o fas] a fas} 36/5 wm [olas|o|s |u| o | ws] 26/5 ‘ince all costicant of devantion variables Ke2 0 Solution i optimal, Max 2 = 54/5; X.= O:X: = 24/5:Xs= 26/5 Maximize Z= 3X4 + 4X: + Xs Subjct to X44 Xi= 50 OX, 15% + 202 500 end XyXLX20 ‘as: Xs~ 60, Xs = 0, X: = 0/Max.2 = 260LINEAR PROGRAMMING CHAPTERS 27 FSo.uTong Maximize Z= 3% +26 4% Subjest to X24 X= 50 10%, + 15%; + 2062 500 ond X20 “Arranging second corstraunts as 2X; + 3X; + 4X2 100 Introducing artificial, slackand surplus vaviable 2 3X; ++ 9X = HOAy~ HOAs + 05; + 55 Subject te Xi+%+%+ Ars OA; + 05: + 05:—50 D+ Ke + ANG=AL* As $: + 05:" 100 Ox, 172435 + OA; + OA; + 05, + = 600 XeX X20 Simplex Tablet mowl 2] ]=]s | s |s] =] & | com wfiy-3]-+[-3 |) 0 {wl o |o = m{o|a]a|a | o0]1] 0 | o 2 of 2]s]4)-1fola]o x00 mlole«|7{s |olololi 00 Amanging for identity matrix Old R= OR +R) 10 OR - RFR) * 0 = NewRs t > @) * w= a - ay ew = oe = ass) ots - as) os - ep « 0 = 0 - ©) * Ww = 0 = @n « w = oO Oo - @ * wo = Simplex Table I Row[ Z] Mu |S |S |S [oe] w | & o | 30 ars 23 ot 00 | _ 6003 Old NewR v2 ya va m4 Boomonmne|28 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT a Newt ¢ > 3 0 6 1 3k ap on 7 oe se oe o/s so kt 0 o> 8 to a a -3/8 a oe 1 wo - 3 = 8 2s I % = Ratio R | 2 [Pay 0 = em |fore M 2, Be x | ol] «) ° ° 50 & | o [yal a «Lo fea] a | as | see Now, Rep R= OWRAE @ 1 Wa 0 W/2 2-1/4 2-72, 0, 50 OR > WA Rep R= News [OR > 12 Rep R= New a a pot mz eo 1 + 0 fe 7 He ae Tua Soup se to fw Ol ee Dw os mae 0 = ofa ~ 0 = 0 ae ua «ee ot | ew = 8 0 + 2 «2 + on | o . oa eas uz ew 2 on | sw _ = ok 0 6+ Ue 0 = do . - 0 “3 + up = 0 + w |x x =o a News ¢ > 9a x0 Q wk ° wa 5p 0 + 2 xO ° wa on 0 + 2 2 9 6 lew a ms on x0 Simplex Table 1 Tow % = Ratio ® ° 3 : R 3 3 we Rr 1 | ° -*0 nio|o | sz] o |icvzl->| x2 | a | so | ovLINEAR PROGRAMMING CHAPTERS 29 Rep R: “Old R: 2 O24 02 4 -1 0 10 OUR + Rep i= New [OM Rep New 1 + . = 1 a a * 2 = 2 of ee 2 ead ° . toe a Bo ee 2 oe a ° + > = 0 toy H 0 = 4 a + 1 ° ee er) n + 1 = w Bo 8. 4s oo ° + . = 0 o + # » 0 = 0 10 a o + s » m = 9 oun + = Rep. NewR o+ 3/2 ° = 8 + 32 x 2 - 3 + 2 a 2 4 3+ 32 ° > 0 + 32 x a = 0 + 32 4 = 3 22 eA > 0 + 32 x ° 1 232 «wm = aso Simple ible ¥ Row Ms | a) & | S| Cont) ® 1 ° [as | 8280 R 1 ° a |a | a | oo | 10 R a a o fa |e ae) Be 4 0 o | 3 | io 1_| 40 ‘Since all Yanable of Ry 0, the optnzum sotution i achieved and sehuton 3 Xe 50, Xi" 0, Xe 0, Max. 2= 250 & Max.Z = 6tOX; + 500% Subjct to, 13% + 20x < 600 10x, S905 200, x20 SX + 5X2 =150 Ki = 1X2 = 20, Ma. Z = 16000 3. Amanufacturer makes two products Fy and Py using tho machines fy and My, Product Psequires 3 hows fen muchine Mi and ao time on machine Mz product Ps requices 1 hour on auchine My and 3 hour on rachine Mf, There are 16 Fours of ime per day availible on mectune M, and 30 hows on Ms, Profit margin from P, and Ps is Rs 2 and Rs. 10 per unit respectively. What should be the daly production mix to maximize profit) ‘ns: Pract? = 12, Prout Ps = 1, Manu pf = Re. 102.40, Fso.uTong ‘Machine Mi ‘Machine Ne ProduciP thous ° Prefit2/ unit Product Ps hour 3 Profit 10 / writ ‘Availabe time 0, optimum solution obtuined and solution i Xp#12, Xo 10, Mee. Z= Re. 10240 4. Two matenals A and B are sequiced to construct tables and book case, For one table 12 unite of A and 16 ‘nuts of B ae needed while for « book case 16 wits of A and § units of B ee required The protit ona bock «case is Rs 25 and Rs 20 on a table 100 sits of material A and 60 units of Bare available, How many’ bock cases and tables be produced to have maximum profit Formate thie asa linear programming problem nd solve by simplex method. [ena Te 2008) ‘as: = 3,Xs = and Max. 2 » Rs 160,LINEAR PROGRAMMING CHAPTERS 31 ‘A manufacturer produces two items X; and X; Xz needs 2houss on machine A and 2 hours on machine 8 Xeneeds 3 hourson machine A and Lhour on machine B. If machine A can runfor a maximum of 12 hours per day and B for § hours per day and profits from X: and Xs are Rs 4and Rs 5 per item respectively, find by simplex method, how many items per day be produced to have maximum profi” Give the interpretation forthe values of indicators! corresponding to lack vaiablt in the fina toation = 9, Te = Zand Mat. Z = Rs 22 Product A generates profit Ks 29 per unt ard B Ks. 4 per unit To manufacture the product wood and slue area required inthe amount shown below. Product Wood (cubic feet) ‘Gluein owners 5 2 2 Available rvouries include 250 sabi Teak of Wood and 10) ounces of gue, Required: 2 State the objective function and constraints in mathematical form, 1 Find optiqsam elution sing simplox method [BRA TU 2007) (o)MarZ = 26 + At, St: 4s + Te < 280 (Wood, 23: + 2 10 (Se and, x22 0 (hn = 23.35.12 = 2666, Marz = 1065 ‘A desler wishes to purchase a number of fans and electic ion, He has only Re, 5760 to invest and has Space for at most 20 stems. fan costs him Rs. 360 aed a electri iron Rs. 40. His expectation is thathe can sella an ata profit of Rs 22 and electic ron ata prot of Rs. 16. Assuming that he can sell the tems the be caz buy, how should heinvest his money in order to maximize his profit? Nero Fons= 8, umber of Ect: Fon = 12, Maximen Profit = Rs. 382 Costs) ‘Profit (Rs) Fane 360 2 Electric ron 240 18 Lethe solved ty Keats of fans and XG ws of elecsi Hon such at Maximize Z = 2+ 18% Subject to 360%, + NOX: < 5760 (Budget constraints) 2Xx+ Xe 20 (Space constraints) XuXe20 “The equation can be arranged a2 Maximize Z = 2X:+ 18%: + 05+ 08; Subject to 360K; + MOX;+ S + 05: = 3760 TXe+ De + 05, +5:= 20 X20 Row |Z S| Const | Ratio ® YL =o | x | fo Oj] 5760 | 16 R_ | o 1 |“ | 2» Operating Rep. R, O14 R,> 60 0 1 4/3 1/90 0 16 Ry-+ Old Ro +22, (New) Re 1-2 18 0 0 0 22RNew): 0 2244/3 22/360 0352 ‘NewRe 10 -1/3_-41/is0 0352 Ry + Old Rs +R; (New) Oak: 0 1 1 0 1 2 o 1 43 3 0 6 oo as -/s0032 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Simplex Table Row [2 Pee | ss Const | Ratio ® ~ Tear a x Ts se" we | 2 R BT T1730 + | 2 Operating Rep. O14 3 oo 1-10 3 2 New R,-$ O14 R,-3New Re owe: 013/500 6 2/3 © 0 4/3. 4/180 2 Newke 0 Tia ne vo1R, APR asen) ord Re: 10 -10/1 11/180 10/3R(eew) 0 0_*10/3-—- 1/36 7 Te © 3/5040” 362 Old R,~ 0167 » Rep. Rie New, we get ‘Shunplex Table Row [2 > M [ | s [ § | Const | tatio Re | 1 [0 [0 | 00s [10 | 392 x | o | 1] o | om | -2 | ‘s m | o | o |] 1 | om} 3 | » Singe all values of Fo> 0, optimum solution isobtaned, and optimum solution X= 5X 12, Mae. 2~ Ks. 382 8A firm hastova gender of cashow mst: Grade 1-750 kg. and Grade 1L1,200kg. Thece are ta he mixed in tora types of packets of 1 kg. each economy and special. The economy pack consists of Grade I and Grade It in the proportion of 1, while the special pack combines the hw in equal proportion. The contributions of the sconomy and the special packs are Re. 5 and Re. § per pack respectively. Formulate thi a¢ a linear Programming problen to maximize contibution and solve it by simplex method. ‘ns: Number economic yak =900,Nember speci pack = 1060 and Maximum contrition = Rs 12,900 = Nats Economy is | ~ Special ‘Available quuntiy Grade T % * 750 Grado 2 % 4% 200 (Cotibution BS Res Let x:pachets of economy and: pecket of special be packed such that. Max, Z = 5X; +8X: Subect to 1/4%; +1/2X <750 grade I-constraints 3/4% + 1/2 < 1200 grade I~ constraints XuX%20 ‘Adding slack variable, we get Max, Z 5X; +8X;+ 05; +05; Subect to 1/2%,+1/2%+5;+ 052" 750 3/0 + 1/2 05, +5: 1200 XyX20 Stanplex Tablet Row | Z S| Ss | Const | Ratio Rm | ° 0 °] - Rm | Con Sake] 70 | 100LINEAR PROGRAMMING CHAPTERS 33. Operating a8 Rep. R,~ O14, Ry OW Ry +Snew Ry ols 1-5 8 0 0 0 SNwR: 9 4 8 36 0 12000 New Re 1-10 1% 0 12000 Rr: SOM Re-tenew Ry Cree 0% % 0 1 120 MNwR: 09 4% 0750 . 1 a Simplex Table I Row Si_[ 32 | Const [Ratio RB [od 6 0 | 200] - R 2 1500 | 3000 x | pom = a0 | 300 Operating | Rep. R:=20H Rs 010-2 2 90 Ry POW Ry +NewRy Old Re 1-1 9 16 0 12000 New Rs o 1 0-2 2 90 NewRe 2002120007 RF OLR: -H New Re olds 0% 1 2 0 1500 “Nek: 0 4 0 1 480 NewRs oO 1 3-3 1050 Simplex Table It Row | Z| | % |S |S | Const | Ratio m |] |e 7 2] 2000 x | o | o | 2 3 = | 1050 mn | o |i o | -2 2_| 200 Singe all Value of Re 0, the optivam solution is oftained and optimum solution i X# 900, X. 1050, Maximum 2 = Rs, 12800 9. A firm produces tees types of othes P,Q and R with thee kinds of wools: ed, green and blue, One writ of length oP nesds 2 metres of red wool. and 3 metres of blue wool.one uni length of Qnaeds 3 metres of red wool, 2 metres of green wool and 2 metres of blue wool and one urit legth of K needs 5 metres of green wooland | mates of blue wool There are only & metres of red weet, 10 metres of green wool and 13 ‘metres of bise wool. The profit expected from a unt length ae: Rs. 3 fromP, Rs. 5 fem Qand Rs. 4 fom R. Formulate the above problem ina linear progremming model end find the optimal sokuton toit using the epprosimate method. 8 3 2 aw a rt = 38s =F, ne = Bay34 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Wool] Red | Green | Blue | Profit Product ? 2 3 3 @ 3 4 3 R ° 5 4 4 ‘Availatielength [8 » | 8 Let X, Xtand X be the unit of product PQ and Rsespecively. Then, Max Z = 3% 23K + 4X Subect to 2X4 628 2X + E10 K+ e495 Introducing slack variables to given constraints Max. 2=3% 25K + 4X5 Subsct to 2+ +5/°8 D+ Dee S8 10 3X +5 + G45 XX % Sp 20 Stunplex Table Row |Z % | _% [_&_[_&_[ 8) ] const | Ratio we | ats es a 0 Q | x | Cam tis 5 | ss Rx | 0 Tt w | os we | ol} s [hail « ° ° a [os | sya Replacing R, > Od R,/3 0731 0 3 0 0 ¥3 RiP OW Ry +3 New Re OR: 1-3-5 -4 0 00 0 5NewRs 9 1/3 5 0 5/3 0 0 40/3 Re 1 3 0-4 5/3 0 0 an/3 Rr SOW R-2New Ry Od: 0 0 25 0 10 2New Ry ° 16/3 Re o o 1/3 Ry SOW R-2New R, Od: 0 3 4 4 0 01 BS ANewRe 0 §/3 4 0 4/3 0 0 33/3 eo 0a wp 01 We Simplex Table I foe [2 [xe |e Const | Ratio Ra sO 373 4073 |= x | o | a3 | a 8/3 | = R | Om = u/s | af x | “o [3 [70 ap | wn Replacing R: Old Ry/5 0-4/5 0 1 3/18 4/8 04stDo LINEAR PROGRAMMING CHAPTERS 35. Ry Ol Ry +4 New Rp OR: 1 1/3 0-4 5/38 0 0 0/3 ANewRe 0 -16/5 0 4-8/5 4/50/15 Re 1 -WW/B 0 0 7/8 4/5 0 26/15 Ry OW Ry-ANew Ry OR: 0 «1/3 0 4 -4/3 0 1 1/3 ANewRe 0 16/15 0 4 8/15 4/5 0 56/15, m0 aa ab 18 Suplec Table ez —— Coma Bate = ows Be] = ° | ws ae ® i | 2hs | asf | te x Tes els mfoun, 0100-47-97 57 37 2 Bes 01+ Nee oma 1-8 0 0 says 8 h/sNewR: 0 1/1800 Wits -w/tes /zn_a/s3 Re a mseancteoss oun 0 2/3 10 43 0 0 pate 0 2/3 0.0 -8m -37n wa 2/7 we) Fyn nonein Ro ats 0 1 ans ys ows GisRe 0 4S 0 0-605 -s6/108 4/an_4/38 oe oa aye samples TbteY ‘Row Zz x Xe Xs Si Sp S)__| Const. re] a fe) ef 8) at) am | ae ay eyo fe] a [os | ss | sa | awa | Som R of 0 | ot | ae | aa | wa | aa aiols| os |. |u| wl w | oe Tl Rase> wor Be Therefore lon opin oe Ma. 228 x= 8 038 2 ‘A manufacturing company manufactures two different products, The demand for both the products i Strong enough 50 thatthe rm can sell as many units of ether product or of beth, as it can produce and at such a price as fo relize per unit profit contibuton of Re, 16 on product A and Re. 10 on product 8 Unfortunately, the production capacity of the company’s plant several lnited. This imation items from the fact thatthe manufacture of the products involves the utilization of three scarce resource: raw material, Inbor and machine tine, Each unt of product A requires four units of rew materials, thee writs of labor36 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT nd two writs of machine time, Each units of product B requires two unis of rae materials, three units of Iubors and five units of machine time. The firm has 2 daily supply of 24 units of raw materials, 21 units of Inbors and 30 unis ofmackine time, Formulate a linear programming model asd determine how much of each product should te Banuiachued to mations total profit contsbuton by ucing implox method, Naber ist product = 6, Mumbo secondprodut = 2 So = 10, Maxinan prof = Rs. 100 Produd | Profit Rs) | Nateval[tabour ‘Machine a 16 4 3 2 zB Fr 2 3 5 Supply Bait Bent Wants Let the ams produce %; units ofA and 7G unis of B we get Max, Z =16X; + 10%; Subject to SXi+2¢<24 (material constraints) 3Xi+3K<21 (labour constrains) 2Xir5K<30 (machine constraints) Xy%z0 ‘Adding slack variables to given constraints Max Z'™ 16%; + 10X; Subsct to 4X4 2%: +5,=24 axe G45: 21 B+ E5030 XX 525220 Simplex Table Re . | = x | Cot a | 6 R | 0 a | 7 x | 0 30_| a5 Operating Rep. R, Old, +4 o1 & % 0 0 6 Re Old Ry +16 New Ry olds 1 -% 0 0 0 0 0 ieNwR: 0 16 8 400% NewRe 10-2 40 0 9% Rp OLA Ky S new Ky old Ry 0 3 3 0 10 a 3Rinew: 0 3 3/2 % 0 0 18 News ° ry Ry Old Ry-2New R, ond Rs 0 2 1 90 2NewR: 02 2 NewRs °° 1s Row Tat Re = R 2 R 2 5 13/4LINEAR PROGRAMMING CHAPTERS 37 Operating Rep, R:=2/3 Old Rs 0 01 -& 73 0 2 Ry POW Ry +2 New R: o1aRs 1 0 2 0 0 % 2New! oo 2 wao 4 News 100 a) Rit OLR: tsnew Re MNwR 0 0 % -% 4/3 0 few ° = Res O1dR-4New Rs ola Rs oo 4 o 1 aNwR 0 09 4 2 9/3 0 8 few Re on 0 Simplex Table Ht Row |Z [Xi [| 0S | 0S | 05) | Const ® | 1 | o] 0 3] 43 | 0 | 100 x | o | 1] o s | aa | o 5 x | o | o | 2 u [as | o 2 mw | o | o | o | ¥2 | -3 | 1 | 0 ‘Since all yariatle in Ry >0, optimum selution & obtained and optimum solution © Xp25, X= 2, Max. Z= 100 AL, A tape recorder company manufacturers models A, Band C which have profitcontabution per unt of Fe. 435, Rs. 40 and Re. €O respectively. Each type of recorder requises a certain amount of time for the ‘manufacturing of component prts, for assembling and for packaging. Specifically, a dozen urits of model ‘A require hours for mansfacturing, 9 hours for assembling an 1 four for packagng, The comesponding ‘gure: fora dozen snits of model Bare 5,4 aad 2 for a dozen unis medel C are 6, 9 and 4 During the forthcoming week, the company has avaiable 130 hours of mazufacturing,170hous of assembling and 52 hours of packaging time. Formulate this problem of production scheduling as en LP model s0 as to smaninize profit ‘as: Mode A = 0, Model B= 20, Model C= D8: = 60, Maxine prot =P. 12.80 Fso.uTond Mode x z C[ avatabre tne refit 5 0 o Manufacturing ah | Shes 6 130 ‘Asiembing Shs | ates. 8 170 Packing ine | 2hrs 4 2 Letdozene be x x LpPformulation Max, 2913 12X;+ 40 "1220+ 60* 1258 = 180%, + 480X2+ 720% feD eBGrGe ID jez =7/8 ‘Subject to 4X, + 5X2 OX 130 Rie DT INS 17D Xp+ 2G GS 52 XX XI2038 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Introducing slack variables Max, Z'=3X;4 &X+ 12X)+ 05, + 05; + 05) Subct to 4X+ 6+ OX + 5130 B+ 4+ 9+ 5:2 170 2o7 2 BOTS) Simplex Table Rew] Z |X S| Ratio Re 0] = R ° es & a 70/9 ° 3 B oar 2 Rep Ri = NewR:[OMR 6 > Rep RB ~ NewR 1. + wo. 0 = a)o0 -6» 0 = oO 3+ Bx & = 0 | a 26 He 52 2 + me a of 6-6» 1 = Oo o + 2 x oC ofa - 6 * o = a o + ww 0 = of o -6 » 0 = oO o + ww 8 = 5 fo 76 e He a2 Rey cs ss Rati % [4 oo = x {fo ioe 26 x | o opt xo no olo 26 Tale upper smaller ratio= 26 Rep R= O1dRi+? 05/4 1 Ot 26 OWk: + 2 Rep = New [OR vi Hep. > News a 1 ]o +40 ° +2 e a = onl te se = ows + 2 e 0 = ofo + 0 = 0 22k 8 2 1 fo te oe ew rr a re foe mk = onl te oe = ome soa we = | st osLINEAR PROGRAMMING CHAPTERS 39 1 o - x 0 = 0 2 x m= os Bo x % + 0 Simplex Table IT Re[z[M [x] [5] s | 5 | com w®l1]s2}e]o fi] o | 32] 20 Rn} o}sa] 1 | o |] o | -% 26 xn | ofms| o | o |u| a |-ays| 66 mw | ol-ss| o | a |-x| o | 5s ° ‘ince all lements of Ry we postiveand sere, Thestiore solution is optimal z-208 Max. Z =208 » 60 12450 X27 26,255 0.%1=0 Xz =26 dozen 26 112 = 312 units 12. A printing company mua: Hoe grades of wall poster. Tho better quality pastes salle for Re. 259, [ntermadiate quality for Re 2.00 and the poores quaty poster for Rs. 1.50. Pager costs Re. 075 for aach of better quality poster and Rs. 0.50 and Rs. 025 for each of intimidates and poorer quality poster respectively. Because of poor quality paper, however, theless expensive posters requires twe minster of prntung time while other two Fequire 1 minute of panting time only. The department is allocated Ks. 150 per day for paper. There are 450 minutes of printing time avadable daily and each minute that is used to ‘timate to cost the company Re. 0.25 In addition, department incuts feed daiy cos of Bs. 135, which ae sot afacted by the quantity and qualty of papers produced. You ave asked to suggest as to how auch of ‘ach typeof posers to produce in order to maximize daly profit? ‘a: Pt = Re 00, = OX: = 28D ands = 120, Fso.uTong et X; Xe and X be the number of units of betes, intermediate and poorer quality posters produced respectively [Let Z be the daily total post. Given. Xe % % cr Rs. (075 Rs 020 Rs, (025 = (03) = (025, = (025.2, Prott contabution Bel Be 12 e075 Max Z= 150+ 125G+ 075) Subject to 073K; + 020x; + 0.29%) 5150 Xi: +X +2%5 480 where Xi X, X62 0 Introducing slack varables 5; the given LPP he changed into Max, Z = 150%; + 125%; + D75X + 05; +05 Bt O7X:+ 050% + 023K+ 5: + = 150 X14: +2X+ 05; + 5.480 where XX Xe 5 2040 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT simplex Tableau G a [15 | 0s | 0 [0 ato Be [Comat ws De | [| o fs Lm BrP esa] 0] /075= a Min o|s Te pa pipe peta] sow zo fo |e[epe]. = [as }aas}as [0 [0 Entering vanble cand outgoing Rep Ri OR, -073 90 079 1s aaa 7075 075 075°075'0.75 0.75 ~700.13-5-3-0 Updating R, OUR = —ivRep = Nav rn 1 2 wp fo 2 2 mp fo 0 > has ys 3 bod Singh Tabla G io ias [os | oo Ratio cena a o Px x0 1 pas Pusp as | 0] aoas-m0 o | s [soo 5 Pipe as a] 0-13-68 z-¢ 10 }as[os}2 [0 tering vatses 3 and ouigung 5 Rep Rr O1dR 3/5 3) 31,38 2-43) 2 wrodod hd dB 1g 13 2002 Sake 2 lye FT ae > yeas 2 we yea = 4/3 - 4/5) 8/8 Simple Tablenw G a5] 188 | 0% | [0 Tato BW [Comte] we | sD a0 | Low OOPS [aS] 1a /S~ Ba mn ox | [Te pas Pa pas] tena -ei0 Zsa | 150 | 105 | 07s | 150 | os ze o Lax} 0 pase poas EnteingisX and calgon X Rep, + OR} vated B23 0088 an§, $08.8, = 280,5/3,1,0,8/3,-1/3‘as: Min Z = 20851 LINEAR PROGRAMMING 1s -~SCO/SQ OO ee ee ws - yet = 8 en es 45-183 7 43 3/3 = apse) = 2/3 Simple Tablean TV G 150 | 125 [os] 0 [0 BY [eotant | fe |e sf ise | mo [as] 4 ws | 1/3 o7 |e | wo |-ys| o | a | ys] 25 =3e0__[ ass [28 [ozs | 338 | 008 zi 033] 0 | 0 [233 | os ‘since all th elements of dex row bv ZC E0 S50 the optinum solution isoptimal, 2 Rs. 390,Xs=240;S,= $= 0;X = OFX" 120, Salve the fellowing linear pecbleme using simplex method Minimize C= 6X-+ 8Y Subjetto 4X +3Y 2120 wher, X¥20 Dandy ‘Adding surplus and artifical variables to given constraints Min, = 6X = Y= 10A; + 10A; Subject to 4X + 3Y -S:+ A= 120 3xs ey 57 AH 19 XY, S52 Ai, As20 sige DL ST ee ae Tafa pe spa no RAR ne Peps See eo Memb far te tarfaet e| ofan mee emer = rye pepareye fe fa nape SE shasdabo Reng ens sees be ees os CHAPTER 542 CHMDTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Ri> Ol R,-3 RepRy oan [o] 4 ]s]a|° ]1] 0 |1 srepr | o | 72 | 3 | 0 |-avz| 0 | 2] o NewR; | 0 | 5/2 afaz[i [ane ‘Simplex Table Ht Row [©] X|[¥]S | & | & | Al | Constat] Ratio m® {1 [>] 0 |-0|-msl o [-aa| 70 s BE efapwit pa] «© | a mw [ofett[>lae;o [we] ~» | » A y+ Old Ry -25 Rep, Ode | 1) 3] 0 | 0 |-a/s) 0 | a) 70 zRepR, | 0 | 23 | 0 | -46/5| 28/5 | ~46/5 | -23/5 | 552 # Newk [1] o]e, a 136 | 28 Ri O1R:-F RepR ome] °] zl] © | we] © | we] o yarep | 0 | 1/2] 0| -5| a0 | -y5 |-a/0| 2 m |-|-/[-[+]-|+ | + |- News |e ft) [ae | ae fae] ‘Simplex Tablesu lV Row [C[x|[y] S| 5 | A | A: | Constant] Rao Be [2] © | © |W | -2s0/29 | 40/5 | mers | 208 Rm |o}a}o|-as| avs | as | -vs | 2 m lololilus| ap | -vs| as | s ‘since al elements of fy are postbve or 2210 Solution i optimal Min C= 208;=24 y=8 Alternatively ‘Simplex Method "Adding sarplus and artical vatiles te given constaiats Min C= 6x + Sy + MAL+ MA: Subect to x 3y-5,+ A= 120 3x +6y-5: A= 120 X52 Sy A ADED G é]s|e¢|o|M[™ Ratio 4 [BV [Constant [x so | & |x| a u [a [me |s fs ]4]o]ife w m_| a [ms t+ fea 20ma =o [| om [MM [Ma z 7-6 [aes] [| o LoLINEAR PROGRAMMING CHAPTERS R404 -3RepRs oan pm. aps pape yay. srepr | «0 | 3/2| 3 an} o | a wen Lette fa pats tan Simplex Tablet G So | 0 [My Tato BY [consent fy ss ss Ta rs a a s | y [wp z Pr 2 |e ol ve o Zoe [Suzea] sar [ues pt aaa 5 sMj2e2} 0 | =m [w/24/s| 0 [-awr2-3| Rep} O14: 2124 $ or =]ipo |ae] ow Breps, | 2 |¥2] @|-us] a720 | 5 | 120 sek [Ss [ola as [as | as we Simplex Table 3 e[st eT ee BY | Contnt |x | s a sfx? = [ipo] as] as] ws] as 8 s lola | ys | ans | ays | ans ams fs | s | ys [ass | 45 [ais zag pole] ws [ays tysu fuss Since all ZG 20 Solston i optinal Min Z = 208: =24 and y= 8 Do Min. C= 104; + 15 + 20% Subject to mtde + ig? Sui +6xy +739 2180 10x, + 154; + 20s 2 450 and xp x29 ‘as: Min 7 = 460,11 =O Xs = 30,Xs= 0 Eso.unong Introducing surplus and atfical variables to given conseaint. Min. Z = 10X;+ 15%; + 20%) +30; + 304; + 304 Z-10X; = 15X:- 20%3- 308; -50A;-30A:= 0 X142K+ 3X) Sy +Ar 60 BX + OK + MSs A= 180 I+ DE OGG + ALM 90 XXX Av Ay A, Si 52-5520 a44° CHMDTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Simplex Table z[_u[x[xTs[s[s [a | a [A [cost ® [a | [as | 2-0 |e | 0 | -0 | 30 | 30 | 0 wfola]2|3]-+}oe]o/1]o] 0] » rlo|s]o6 | 7] o }-+)o/]o {1 0 | wo mlo|2/}]s3sj2/oJ}ol+1}/o0j/o0)]:1]|% Be OR +30 +R +R) olde 1-0-5 © 0 0-20-30 -9 0 30+ R+R): 0 40 330 -30 30-30 30 30 30 $900 3 Replacing Ri O1MR:/3 0 1/3 3 1 -173 0 0 1/3 0 0 Ry Old R400 Rep. Ri Old Rs 1 0 4 0 0 $300 00 KEP. 0 200 00/3, ° 2 0 S00 Re 1 3 WS 0 S/S -30 0 0 BOO Reb O14R-7 Rep. Re olay 0 5 6 7 2 -1 0 0 4 0 189 7eepm 0 7/3 4/3 7-7/3 08/8 ao aRepR 0 4/3 9/3 4 W/O Re 0 7s so 4/30 “480 1 0 Simplex Table Lt x [xx Tats Ratio mo | -ve a0 | 12/7 R 23 | v3 a |-ws]o fa | w jsae 3 Replacing Ri Old Rs 04% 01 0-% 10% we Ro ORS Rp. 1a Re 1 0 1/3 0310/3 30-30 310/3Rep.Re 0 10/6 310/22 0 3103 0 10/4 400/30 0 1900 30/3 0 HO 7 as BrLINEAR PROGRAMMING CHAPTERS 45, 1 RoR dR R oR: 0 13 43 1-18 0 0 13 © 0 » Y3RepR: 0 1/6 V2 0 1/3 0 -% 1/3 0 & WempR 0S 4 it 0 0 -% 0 © M aj Ri Old: -FRep Rs dR: 0 6/3 43 0 7/3 -1 0 -7/3 1 0 0 7/3Rep.R: 0 7/6 7/2 0 7/3 0 74 -7/3 0 1/4 35/3 is 032% 0 0 1-7 0 1 WA BD Simplex Table IV =] 230) -215/2. Se a 3 ag em 0 231 ys 0 0-43 0 0 ys m0 fo 01dty 8/2 Rp Be Cake a ws asf 00 “0 0-2 3 Siten 0 Bs B29 o o 0 wh es OT ae — cur 0 32 % 0 0-1 7k 04-714 RS seronamne bones we WERE LE 44S Be eee Be eae ee 0 0 ye Be a tera aae es Simplex Table <1e 43. 3/2 22/346 CHMDTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Minimize Cost =Rs.20A +Rs. 108 Subjetto A+ 1B<40 4A+30260 3A+B290 ABDO ‘aa: Mi. ¢ = 240, A= 68 = Simplex Method 128-10 Introducing slack. surplus and artificial variables to given constraint Minimize C~ 208 + 108 + Ma; + MA: ‘Subgctto A +25 +5,=40 4A+3B-5:+A;=60 BA+B-S+a-9 ABS, 5,520 Stmplex Table c ° wi v3 0 0-3 0 4/3 OR, RepR) = NewR[OMR 4 = RepR = NewRs o- » > » |e - 4 uo > OD roe 1 se ofa -4 1s 6 2 - wo - sls -4 w= 58 a - 0 = 1]o-8 o = o = 0 = ofa sa oe 4 © = ey = wl] o = 4 = Cy = 49 o - 0 = ofa -4 oO G eo - wi o- -ys|o - 4 ys = 43 Simplex Table I G 2 [wy] ol]e]ef™m|™ ‘A:_| Ratio ys | 3 2 30 3 Rep R:+30H Re po1r0o 2LINEAR PROGRAMM NG CHAPTERS 47. NARs = W3_* Rep Rr = News > 5/3 = ow fo -~ n = 6 0 = 3/3 x - co | a -ysx 0 = 2 53 - 5/3 * - oc |ys -yax 1 = 0 1 5/3 x - 1] 0 -13x 0 = © 6 5 5/8 = 6x9 = 2 | 0-4/9 ~ C9) = 4/5 ws - 3 48 = at Jays =~ 4 = 38 0-5/8 x 98 = 3 | 0 1/8 x 9 = AHS p< cay = 1 | vs ~~ cy = 98 Simplex Table Ht q 2» [ow loyele[™M|™ BV Cont [A | B | & |» |S | Ay | As | Rato ots] 10 a owls] 2 o | 1 | o | -35 | 45 | a5 | -as nial « ‘ o | vs | -x3 | ss | 9s Z=20 20_[ 10 [0 2 [4 [2 4 ZG of 0 | 0 | 2 | -4 [-Me2|-mea Since all © are ve oF 2=0. Solution's optimal Min C=240, A= 6 B=12,5:=10 Revised Simplex Method Introducing slack, surplss and artificial variables to given constraints, Min C=20A + 108+ 304: + 50: Re ©. 20A,- 108-30. 3080 Ri A+2B+5:-40 Ry 4A+38-5:+A:=60 Re 3A+B-5:+Ar=39 A,B Sy Sy AvAr20 Simplex Table Rew] ©] A e] Ss | & | & | A | A | Cont ® 2) -2 |-0 ) 0 | 0 | « |-» | -3 |) © Rlo| 1 2] 1] 0] ¢ | of] o |} w Rlo| 4 s | o | a] e« fa ]o | B 3 atofol+aloj:i| » ROR +30(R +R) ols 1-0 - 0 0 ¢ -30 -» 0 302+R): 0 20 12 0-30-30 30302700 Re 1 19 410 0-30-30 0 0 2700 Simplex Table I Rew [© A] = |S | | & | A | A | Com | Ratio R | 1 | 390 “30 | 30 | 0 | 0 | 2m | - R | 0 » 0 R o 6 B 2 0CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Ry Old Ry -190 Rep. Bp old Rs 1 190 100 0 -30 -30 0 0 270 wWoRep.Re 0 190 190/30 0 -190/3 0190/3 1900, Re 1 0 0/30 -30 10/3 0 -190/3 500 Ry SOUR, Rep. Ry ous 01 2 10 0 0 0 w Rep. Re on 0-73 0 3 0 a ae Bo ouR ARR, m_ se yw ye we freer: 9 4 43 0 8 ays 0 ° Staple Tabet Tow a : ae a ‘ > 8 B 5) ¢ a a | lag Beary, oo 1 6 3s 4s 98 ws 2 m9 Mee 5 oid tet ee iow (TRIS soe Re TS ROKR, o1d Re: 058 1 0 V3 0-13 30 oo tt ta 10 ola Rs 0148 0 0 3 0 3 10 VsRepRe 0 0 1/3 0-1/5 4/5 5-44 ® oe 38 1 se Simplex Table 1V Ree [ep ay eT so | s [sw [©] Cont ® | 1 | 0 | 0 ]~o | -2 | -4 | -28 |-3m/3] 240 x | oo fo} ofa fa | a} a toa . x | o | o | 1 | o | -35| v5 | 35 | -s| 2 mw |oo | 1 | o | o | ys | -3/5 | -ys| 35 | « Since Ry Snegativeor 220. Solutions optimal Av6,B+12,5,010LINEAR PROGRAMMING 4 Minimize 2=X,+2%0+3%s Subject to =Xi+2X2+ 2X" 10 +2804 3/918 and Xu XO ‘as: X1~ 0,35 = 6,Xs= 0, Min 2 = 15 = ‘Adding artifical variable we get Minimize Z = X:+ 21+ 3Xs+ 10As+ 10A: Subject to -Xi+ 2X:+ Diy+ A+ OA: = 10 CHAPTER 5 Ter Dersieroars eis ncManane simglee Taber Stet et et et ae perting oa minh es erp See ae a Omen 0 = a» wo RB 1 2 3 #7 0 0 250 Semple abe a a Td = x | fo” “aa | ana no 13 saline Rep ORR? sis ara Oak nen 8 7 00m ref 238s. | 2 ea Re OWR-SNew Re o— es atk 3 See 0s? 3 3? Splat ie] tee ee ee wt Peep e tet | ; ‘ ae x |[o 2 Q opening pmeaense Ot} 0-3 2 0 Be OM Rs fNew R a a ae Siam 03230 so Re 10“ 0-16-55 ”50 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Hei ies o 4 10 oo 13 zx | [| % [a [a [const | Ratio 1[of-wlo |-w]-3 [os wlo|a{-2]o]-3}2] 0 | Since all Revaziable in <0, optimum solution # obtained $2.) 02499, %"O, Min. Z= 15 Minimize C= 3 + 4X2 Subject to aX; +>30 Xe-Xee-18 H+ 3228 XuX>0 ‘as: Min = 9, X= 19 Xe= 6,12 27 Fso.uTong Introducing sick surplus and artuisial vaiabes to given constraints Min C= 3%, 4X3 + 10X;+ 1083 + 10s C-3%)- OG 10A;-104;- 104)" 0 ‘Subject to 4Xie X-St A= 30 Xy+Xp-Se4 A= 8 X73 Se FANS Xi 5p Su Se Ay Ay AZO Simplex Table 1V row[ ec] [x | s | s | s [| a | A | As | Const. a rr) 0 | ]-w|-0] o mle} a fi] o}a}o a | o | as mie}i] s/o fof+}{ofo}i| x Be DOM Re “100K RRY Old Re 1-3-4 0 0 0 -10 -10 -19 0 WOG+R+R) 0 60 50-10 -10 -10 10 10 10 70 Re 1 0 10-1 «0 (0 OO 780 simplex Table I a] S [sa] Ratio “oo a wr afofolfa 8 of-ajolo 28 00 40 0 1572LINEAR PROGRAMMING CHAPTERS 51 Ry SOW R,-Rep.R; OdR: 0 1 1 0 1 0 0 10 3 RepR: 0 1 % -% 0 0 % 0 0 1/2 Rr: 00% % 1 0 -% 1 0 2/2 Re SOM Ry-37R, OldR: = «157 46-10-1000 700 B7NewR: 0 57 57/4 -57/4 0 0 57/8 0 0855/2 Re i 0 mA aa -0 -10 0 0 e/a Re Old Re-Rep. Ry oun: 0 1 3 0 0 1 0 Ot NewR: 0 1 4% -% 0 0 % 0 0 15/2 RB oOo nf 8 0-1 MOT 472 stuplex Table Ht a a ‘Const | Ratio & = | -10 [-s7/4] 0 | 0 [owy2] - ° “ » 42 syn Penang Rs > SOUR, oot vm o-wm am 0 ym sm ia Root Zep. ou 1 tA A dw 00 wR WhepRe 0 0 WA MO -am/ih -imyad OHA wouared BO a : nes o1tR-brep Od; 0 1K M0 0 Oo YaRepRe 0 0% 4/sk 0 -/ -1/k 0 /ik SI/Hk Ce a Se is ig 00% afk O31 -378k 0 37H ord 000 YW 1 3 -yn 1 an HM52 CHAPTERS SOLUTION MANUAL TO OPERATIONS MANAGEMENT Simplex Table 1 w[«[s]s [os [= [a | a [cont [mato 0 | 0 fall -10 |-2anlaera] 0 fazaapiosaa]— - ao faa o | va | a, ayn | -w Cc Er | “ar syn | oa faa raat syn | 2 Replacing R014 OR: 1 0 0 B/N -0 ay -5/11 0 -aa7/ 105/11 15/MR: 0 0 0 1/M_-15/2_-45/2_15/M_15/2_—45/2_ 405/11 Re 10.0 0 5/2 801/22 -10/11 -15/2 200/02 59 3 RS OR GpRep-R, olare O10 3m 0 YM yn Oo -yn wn 3/URepRe 0 0 0 3/ -33/4 -9/2 -3/11 3/2 9/2 81/4 010 0 BA 72 0 32 7m B R yu oo -4/ yn 0 yn sy 01 oo yn 4 -3/m % yn vn o 1 0. 4 -5/m “= 2 0 Simplex Table ¥ rele[ ule ls [ses [os | a | a | a | Come me | 2 | 0 | 0 | 0 |-s/2|-s0/2|-190/m|-25/2|-299/22) 59 rn lol} 1 | o | o |-ssa}-22| 0 | 32| 22 | » mio} o|}o |: |-up} 32] -1 |u| se | x mio} o]i | o | + | -s| an] | 5a] 5 Fince all zo Solutions optimal Min. C#39, "15,649,514 27, Min Cm xi +99 Subject to ne 34 495 modes and x1 025520 a2 BE Bos A A dist fora sick person must contain atleast 4000 units of vitamins 50 units of minerals and 1400 of calories. Two foods A anid B are avadable at a coat of Re 4 and Re 3 per unit respectively. If one unit of A contains 200 units of vitamins 1 unt of mineral and 40 calories and ane unit of food B contains 100 units of vitamins, 2units of minerals and 40 calories, find by simplex method what combination of foods be used to ave last cost. Xi = B ks = BD, Cost = Re 110 sn = 0,B LINEAR PROGRAMMING CHAPTERS 53. [Nepal Television Company’ operates tivo assembly lines ine 1 and line 2,Eachline is used to essemble the components of tree types of television: colour, standard, and economy. The expected dally production en ach line isas follows. TV Medel Tine ‘Colour 1 Standaed 1 1 Econoaty 2 6 ‘The daily running for te lines average Rs 6000 for line 1 and Rs 4,000 for line 2. It is given thatthe company must produce at least 24 colour, 16 standard and 38 economy TV sets for which an cedar is pending. You ae sequzed to formulate the above as LPP taking the objective function as the minimization of total cost feted ar? = 2S 1 Main wee = 7200 ‘Some: TWMoia [et [tet [oe ae ts 7 Sonar 7] i nee s = ease Let and Xe then nea pes Poielap yy 2 case, am Subeto SXer Ko ich ious soeet dinate seal ail atin Premed Ma Zomerceaokce anes Rawson Mokoneact Xigetschcoe Single Tablet ZO tle /a]ayelslelole]a slay as ey spe ya yl ye ys ROTO RR or 3737272 m stetatehe Staples Tablet Sees a iT 4 ew ° Replacing R: > Old Re/3 os 1 0 0 -13 0 0 3 854 CHATERS SOLUTION MANUAL TO OPERATIONS KANAGENENT Ry OLE Ry -48 Rep. Ry cuss 1 sm 0-0 0 0 0 eo ome (has wl ee cts Bi fo. at oe = ta 0 ww ee Be OitR Rep fem 0s 100-00 1S fF RoitR-Reph Rete OS 10 0-8 90 Ws 8 Was simples Tabte rt a or ° Ste = é we 13 1 2 | ot 010 80 v8 0 -¥s « Fou m sine Hmph: 0 1 0 3s 6 IS BIS i =a be Be we ew 3 ROUR-135p-% oun 0 23 0 9-1 as 0 1 aa 8 yam 0 ah tk 8 am wo ae 6 m0 ee wa 7 07014 1-1/3 p.m cus) 3 1 9 0 1s 0 0 ass Vakepke 0 4/38 0 3/8 0 UM as 0 at 2 z a Simple Tale = |S [a ona a0 a Tae i 6 43 Te aft | te taallvs wilt LeLINEAR PROGRAMMING CHAPTERS 55: Replacing Ry» 4 Old Ry 00 0 1 1-14 -1 6 Re POW Rey Rep. ola 1 0 0 13/3 -10 47/3 -93/8 0-7/8 70 W/SRep.R: 0 0 0 17/8 -17/2 17/8 -17/8 7/2 -17/8 34 & TOO 320-18 Rot R ERep R olay o 10 -ys 0 ys 38 0 -y8 6 Vskep.R: 0 0 0 YS -% YS -1/8 % -1/8 2 & o 10 = = 0 4 WO @ Ry-SO1 Ry +3/8 Rep. Rs oR: 001 ys 0-398 -1/8 0 38 6 3/SRepRs 0 0 0 3/8 -3/2 3/8 -3/8 3/2 -3/8 6 Re oo a 20 a 2 0 2 Simplex Table ¥ Zz] ]s]S]s |] | A | A [comm B®] 2] 0 | 0 | -= |-32] 0 |-w2|-wal 0 | 36 wm] o |i |o]-» | # | o | « | -« 4 wm] oo | o | o | a | -« | a 1 | a6 plo |] o |i |] % |s) o v Sine all 6 x - 6 -2 x - 2 o = % x = 26 -2 x = 22 o> x a) a2 x - 4 a0 me * 2 « 2 Gum ue < RR) - NewR OUR) Rep - New 1 - & » 0 = tf] 0+ 0 = 0 s+ & = 1]o0+ 4% = 4 o = we 0 = oe fa et oe o - we 0 = @ fo +o = 0 wo - we to = of ae de Oo -% = w x - = -o la + a = 0 o - 6 ee = slo + eB = m= we i wl es