Scribd
Upload
2K views30 pages

LPP - Handwritten

Uploaded by

SamyakJain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
2K views30 pages

LPP - Handwritten

Uploaded by

SamyakJain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 30
ee ce — saat, )—~, “she Yor Seen ~ Linear Moegraueneey Fovncteeti ary of a - \ gre be Jedeartify the decision variables . Mdeatify the objective fernclion 3. Identify dit The couutraluds é 4 8 decision varia Sypress Lies cts Feaible var vabdes Une Froqrammvels Sol i Sao c aaa ener eter 0 I ae Sinptur Melhed (tre) = Linen Pragromauning- Prablom ssharsrenal vaoelel cf LPP L Foywulodon PB LPP Lee Lee Have aia © owerve function Ze Gutanta% @ subject +o coudtion. Constr ach ob (00% P40 % Ae 0(00, B20 DEA LD I) y Bee MPO At BCG 1875), Ze 1280011806 = good ee Ae GC 200/), 22 Ug guy 1 yp -Gor ‘ ql ey cee ’ GBs 76 = 20,00 THX, 2 G30, cae Ae arene ey a yortion ours \ los EBS, 123i Pacenth je “aud ie figs ee eZ AAp 2 2000 - 1980 Prile on cf feasdhle . mF FS0. 750 2 IDS Ture ane tr tt lich epee. Kank al: valet oP (25, ns) Scanned with CamScanner Cc .@ Using graplaeal Pee), colue the Se 05 Mew Ze 994 13% subj to a ¥ %y-%42 MIAH 24 te 2 / i . t Ls M-m=ER lt te =4 i Fa] A317 5. Bz 2x34 =F BCom), Ze gxorge4ele Zrian 2)2- Here, thes!" shace 15 ton unbounded, The verhies ~ We Feasible region ont A+B Valu of objective Fum- ad, thre vertion_ant Z(A)= 4 But thee arephs ee come req ign Poe weath, [2067 12 | ny [206% 12 | 12 i | Zz will howe wu heghe valu. Sh cape the Fallouly LPP > GQ Salve 9 pity Mat Ze subject 40 ou -%,<7) —%1H, 40 14%, ZO Lianed AR 1-4 t%=9 yeh Scanned with CamScanner SET SE Se ee Ak ~ qe Redundancy i | A combattit ina given LPP is sth vedlundand 14M ftir feyfible region cf “the pwollon nota | by oleh ng Athed ceylralut ! 24+ Graph the Rearibl regiov ao Fallecing pobln and veleatiy dhe a vedundact comstralic, | Max. Ye Sut ey settee Couly al is ated sy Unt oy 490 3utG 43 YO Scanned with CamScanner = Ssjution P que by grpplncel ovata , Gelve the abare problim graphically , ' Max ae f be c @ St x+y 4200 e . bejgey 7 Sem z| Woy16) *, $407? “be p ce sill be mnaXx y a ; = : Yo passen travel by Ist chs. and lb peed poet hee econonn i out “¢ i mate Ze 100%, + HOH. Seb 10 y+. 4a, Saaso 3% + ax, S 100 6% 4+ 12%, = 3000 Hi% 20 ae Wnt 3, ©) ¥ "EZ a Sate m-% =o! I } -4Tu ee and 4,220 nak Scanned with CamScanner il Cee ee a ee Nes teay «hag ncrnmtng Peablem @ BG ea, oe, [objective pumnction J Oa eee (constraint) $b, BG AM G4 - - = + Am Xn hy S et ttt oe ot Bmt Sr Cony NL eed nine ative sees trtctions Mite, > in BO [Feasibility conden] : Tk det valu Gf teyr, eee yy which sadifier Me rtyaliat 4 tot LIPP. ty called its bolulion belutton te 0 LPP urhtoly — the nen- sustatctions yf tbe preoblem ts a aa: slay feasthle Splutton urbieh, maximizes (o rnlntmtzes) Abe Vale fe f he LP.p.- 4 a its eptinal * delublen . ty the constraints a eo Lek be Page; be (ieky, a2, ..-) BY ; - ao ve) ome cabled curblug vont Scanned with CamScanner lanantcal poem °, form of LPP Max 2 = Gy exe TG Subject tee constraint Bh Fah tn Ay Xy S bey LWA - ym WO Ly DD This deur ef the LAP & called tty CanonPeal Jann pA oF charvacterdst ct ; © obpective fro maximization ‘ife CD BU condtrainty ane of (9) pe. ¢ Pil variables xe axe hon — raga Standerrd form me Max. Z BGG t Gy t--- +6 subject Ze the constraing Gay My tag 2 My = bp 5 CEB ees m MH) Mr, = 2% ZO ‘This feem of LPP. is called 28 estand ard fourm and tos following chavactedstia : 6 Objective linctten is 4 ma ximiz atten pe : (@ AL umstrdint are. expstssed af Lo uations Rus. cathy conttraint Lt mon agate @ Al vedabls are non - iged Ue 0 Xn NOTE-© Min Z 2 Gut---+ CnXn te Jnte —-max(-2) = -G%4-O1%7- =" Ont, @ Hw <0 ah eerite fe 2 et xd i cshene rf 70 » Zo (x4 3 unvestricte,)) i ? ul SS Scanned with CamScanner | | | | | | ING an PROGRAM une 317 THE SIMPLEX METHOD INTRODUCTION (®) ‘The linear programming problems the solution of which ean be found out 5.6 discussed so far are concerned with two variables, easily by the graphical method. But most real life problems when formulated as an LP model involve more than two variables and many con- straints. ae oe is a need for a method other than the graphical method. The most popu- lar nomena 7 a of solving an LPP is called the simplex method. This method, developed by oo B. Dantzig in 1947, is applicable to any problem that can be formulated in terms eT objective function subject to a set of linear constraints. There are no theoretical restrictions faced on the number of decision variables or constraints. The development of computers has further made it easy for the simplex method to solve large scale LP problems very quickly. « _ Theconcept of simplex method is similar to the graphical method. For LP problems with several variables, the optimal solution lies at a corner point of the many-faced, multi-dimen- sional figure, called an n-dimensional polyhedron. The simplex method examines the corner points in a systematic manner. It is a computational routine of repeating the same set of steps over and over until an optimal solution is reached. For this reason, it is known as aniterative method. As we move from one iteration to the other, the method improves the value of the objective function and achieves optimal solution in a finite number of iterations. 5.7. SOME USEFUL DEFINITIONS ( Slack Variable. A variable added to the left hand side of a less than or equal to constraint to convert the constraint into an equality is called a slack variable. For example, to convert the constraint Bx + 2y S18 a) into an equation, we add a slack variable s to the left-hand side thereby getting the equality Bx +2y+s=18 Clearly, s must be non-negative, since s = 18 ~ (3x + 2y) 2 0 iby In economic terminology, a slack variable represents unused resource in the form of money, labour hours, time of a'machine ete. i) Surplus Variable. A variable subtracted from the left-hand side of a greater than or equal to constraint to'convert the constraint into an equality is called a surplus variable. For example, to convert the constraint 2x + By 230 A) into an equation, we subtract a surplus variable s from the left-hand side thereby getting the equality 2x + By-s = 30 Clearly, s must be non-negative, since s = (2x + Sy) - 3020 Iby (DI Scanned with CamScanner ATEXT BOOK OF ENGINEERING wn) § 318 in ie over the 8 A surplus variable represents the surplus of et hand si ehthand also ealled a negative slack variable. : , simultaneous linear equations in , (ii) Basic Solution. For a system of ™ simables equal Lo 2ero and sly ah (n> m), a solution obtained by setting (n — ™ led a basic ‘soluition: The (n _ ving re remaining m variables fora unique solution i ca ena therm yeaah set equal to zero in any solution are called non-ba Vatiableg called basic variables. te ‘Total number of basic solution ="C,, i oh - A i ich happe! ie i Viv) Basic Feasible Solution. A basic solution ei happens to befeaibletie, tion in which each basic variable is non-negative) is cal ’ lution. ly. 1) Degenerate and Nop dogenarate Golitiatt). ‘The departing variable is the corresponding basic variable in this row. The element at the Fae sce von of the key row and key column is called the key (or pivot) element. We place a cirele around this element. Ifall these ratios are negative or zero, the incoming variable can be made as large as we pleaie without violating the feasibility condition. Hence the problem has an unbounded solu- tion and no further iteration is required. <->. Step 6. To set up the new simplex table from the current one. ~~ Drop the outgoing variable and introduce the incoming variable alongwith its associ- ated value under c, column. If the key element is 2, then the key row remains the same in the new simplex table. ___ If the key element is not 1, then to reduce it to 1, divide each element in the key row (including elements in xy-column) by the key element. Scanned with CamScanner asl NOE SSS aa in 326 ees old key row ee es kay aia Make all other clements of the key column 0 by subtracting suital row from the other rows. In other words, to change the non-key rows, we Number in new non-key row = (Number in old non-key row) ble multi use theta hy ~ (key column entry), x (corresponding number in ney aj where ‘key column entry’ is the entry in this row that is in the key column, Step 7. Test for Optimality. Ifthere is no positive entry in Crow, solution, Otherwise, go to Step 4 and repeat the procedure until all entries negative or zero. Tow) Wehave an inC-row ILLUSTRATIVE EXAMPLES —_—_—_ Example 1. Using simplex method Maximize Z = 2x, + 5x, subject to Hy + ey S24 Ix, +x $21 x) +%S9 Xp %_20. (M.D.U. Dee. 2097) Sol. Step 1. To formulate the mathematical model of the problem. We ate al. ready given the mathematical model of the LPP. The problem is of maximization type and all b's are positive. Step 2, To express the problem in standard form, Introducing slack variablog 3, Sq S, (one for each constraint) the problem in standard form is: ie Maximize 2 = 2x, +.5x, +05; + 0s, + 0s, ins subject to y+ dey +9, = 24 Bx, +x, +, = 21 Al) (2) xyte,+5,=9 (8) Xp Xp Sy) Sy 8520 Step 3. To set up the initial basic feasible solution. Since we have 3 equations in jtarlables, a solution is obtained by setting 5 ~3 = 2 variables equal to zero and solving for the remaining 3 variables. We start with a basic solution by setting x, = x, = 0, Substituting 1 = 4 = Oin (1), (2) and (3), we get the basic solution 24, s,=21, S529 53 are all positive, the basic solution is feasible and non-degenerate. Thus our initial basic feasible solution is 5, Since s,, 8 %=0, 44-0; 9)=24, 5221, 5,29 at which Z = 0. This initial basic feasible solution is summarized in the following initial simplex table. Scanned with CamScanner { GRAMMING @ 327 69 2 5 0 0 0 Ratio Basis | Solution |~ x; % % % % %nl*2 b(= xy) 24 5s pr 1 © i 0 0 ae 21 Sy 2 3 1 0 1 0 773 9 83 9 1 he 0 1 ae o 0 0 o 0 5 2 + 0 0 0 *For writing the body matrix (under, x,) and the identity matrix (under sy, 82, 53) the Jefthhand sides of equations (1), (2), (3) should be treated as Lr, + dry + 1s, + 05, + 05, 3x, + Lx + 0s, + 18, + 0s Lx, + Lx, + 05, + 0s, + 15 +The Z;row entries are all equal to zero in the initial simplex table. Step 4. To test for optimality. Since some entries in Crow are positive, the current solution is not optimal. Therefore, an improvement in the value of objective furiction Zis possible ‘and we proceed to the next step.. Step 5. To identify the incoming and outgoing variables. The largest positive entry in the C,row is 5 and the eolumn in which it appears is headed by xy. Thus x, is the incoming variable and x,-column is the key column (indicated by 1). Dividing each entry of the solution column by the corresponding positive entry in the key column, we find that minimum positive ratio is 6 and it appears in the row headed by s,. Thus s, is the outgoing basic variable and the corresponding row is the key row (indicated by They pumber at the intersection ofthe Key row and the key column is the key number. Thus 4is the key number. A circle is placed around this number. Step 6. To set up the new simplex table from the current one. Drop the outgoing variable s, from the basis and introduce the incoming variable x,. The new basis will contain | 3y,35,84 09 the basic variables. The co-efficient of',in the objective function is 5. Therefore the entry in cy column corresponding to the new basic variable:x, will be 5. Since the key element fonclosed {n the circle is not 1, divide all elements of the key row by the key element 4 to obtain new values of the elements in this row. Thus the key row o 5 m 1 4 1 0 0 is replaced by the new key row Dem, «6 3 i i io. 70 Now we make all other elements of the k i i suitable multiples of key row from the other rows. ee eee a teed Scanned with CamScanner PPA an ATEXT BOOK OF ENGINEERING MATHEU ‘Ss ‘To replace non-key rows, we use the formula : Number in new non-key row = (Number in old non-key row) ~ (key column entry) , (corresponding number in new key ry, Here s,-row and s,-row (ie., second and third rows) are non-key rows, ) Transformation of Ry. Key column entry in R, is 1. | Rynew) = R,old)- 1 x Ry(new) 21-1x6=15 1-1x0=1 0-1x0=0 ‘Transformation of R,. Key column entry in R, is 1. Rynew) = Ry(old) - 1x Ry(new) 9-1x “iste 1-1x o=1x O-1x The above information is summarized in the following table : Simplex Table II 37 BisiesB Se 0 Osc! 0_. Ratio en | Basis | Solution » |", S57 El 8(= xp) eo * a 1 : 1 6 5 x 6 a riot a ° 4 4 o ) 9 | a= AL 15 _ 60 0 15 = ab ase a 4 8 4 1 0 a1 0 s 3 0 2, ze z ® 4 ¥ 2 w 5 5 SS Z=30 2) 3 5 s D = a ; 4 & a a 9.371;,..0 YZ, = Yepstpy = 5(6) + 0(15) + 0(8) = 30 I Scanned with CamScanner SNH Patan 329 y pniries in Z,-row. In the column headed by 4 s(}+0(7)+9(3) Xe 5(1) + 0(0) + 0(0) | 5 ()oCa)oCs Sp 5(0) + O(1) + 0(0) 8, 5(0) + 0(0) + 0(1) ative or zero, the . A Step 7. Test for optimality. Since all entries in C;-row are not neg! one 3 int solution is not optimal. Therefore, an improvement in the value of objet re : ple and we repeat steps 5 to 7. ; |. js poss ming variable isx, and.x,-column is the key-column.s, is the outgoing baste va! 8 andsyrow is the key row. Key number is. ; ts of the ‘The new basis will contain x,, s,, x, as the basic variables. ing all element 3 i ey row by the key number {, the new Key row is co: 3 ele 20 may-4 G1. 0+ Aa ‘Transformation of R,. Key column entry in R, is 7 semercice 22! eae aaa D 1 Ry(new) = R,(old) - 7 R,(new) 1 6-4-5 leek qr ameo 1 1-G@=1 qa -i)e4 . 4 43)°3 s 1k ‘Transformation of R,, Key coliimn entry in R, is =>. Ry(new) = Ry(old) - ERynew) li ayy a4 6-7) uu ae verdent) i o-4t@ 4 O=0 Scanned with CamScanner at 330 ‘The above information is summarized in the following table. Simplex Table III 57 2 5 0 o 0 ies Cy Basis | Solution |~ x, Xy 8; a ya b(= x9) 7 1 5 4 5 0 1 s 0 i 2 n 0 % 4 0 0 3 1 | -3 1 4 2 En 4 1 0 a 0 = 2333 4 2 5 1 0 1 G=6-2, | 0 0 -1 0 i *Z.=Ecgaty, = 5(5) + 0(4) + 204) = 33 As all entries in Crow are either negative or zero, the above table gives the optina basic feasible solution. The optimal solution is x, = 4, x) = 5 and Max. Z = 33. Example 2. Use the simplex method to solve the following LP problem. Maximize Z= 3x, + Sry + 4x, subject to 2x, +3xyS8 2xy + 5x, $10 Bx, + 2ty + dx, $15 Xp Xp Xz20 Sol. Step 1. Introducing slack variables s,, 8», 8, (one for each constraint) the problem in standard form is : Maximize 2 = 3x, + 5t, +4154 05, + 0sy + Osy subject to 2x + Bry +5, ) 2, + Bry +5, = 10 ) Br, + Oxy + 4xq +952 15 8) Xp Xp) Xpy Sy, Sy, $520 Step 2. Since we have 3 equations in 6 variables, a solution is obtained by setting 6-3 = 3 variables equal to zero and solving for the remaining 3 variables. We choose initial basit feasible solution as : ¥=2)=%5=0; s,=8, 8,=10, s,=15 at which Z =0 Scanned with CamScanner Seog. py Plax 25 Jox, +X, + ax, +X an, 50 (b-v (n.b.y) ob. Bg. Scanned with CamScanner i a Gus Max an 2) oes Kat Sx, MT Me 5 < Jo ax - ty So Pry Bay + 3x3

) Qeyl — ayy! tay ze, B Aiafi t O > unvestrteted dn sym spare | Scanned with CamScanner NEE eT ty Jeneral 4 prtmal is MR 22 guy tat t-- = Tom Str a % + yyty te t4n%n 2b, Qt aXe t - -- + Ary%y = by ami% tamara t = + Amn%n = bm ne 22 thin dual i (Min Wh = bits tater <= + btm vt. Ba tA a te + Many 2G Be fu + faa fa * w--4 re cy ze +4 m 2 om aim ¥) eae on de frac gm all wnresttctid en Sgn . vai sus che dual Yanda cormaperdlin | PRAY, enipuin we unvestoicttd fn Algn- : pustrictd im ston, he primal voit al nibeatde | aoe equal a A jmize fF babe fini . (wid [Ma og + 3%3 23 2H +he- 3%, = -3 Abe 2 a t 2h, <4 3% +0x, 42%3 unrest clad Scanned with CamScanner oe reer NEESER DO 12.13. (1) DUAL SIMPLEX METHOD (26) In § 12.9, we have seen that a set of basic variables giving a feasible solution can be found by introducing artificial variables and using M-method or Two-phase method. Using she primal-dual relationships for a problem, we have another method (known as Dual simplex method) for finding an initial feasible solution. Whereas the regular simplex method starts with a basic feasible (but non-optimal) solution and works towards optimality, the dual simplex method starts with a basic infeasible (but optimal) solution and works towards feasibility. The dual simplex method is quite similar to the regular simplex method, the only difference lies in the criterion used for selecting the incoming and outgoing variables, In the dual simplex method, we first determine the outgoing variable and then the incoming variable while in the case of regular simplex method reverse is done. Scanned with CamScanner tec NUMERICAL METHODS IN ENGINEERING AND i a : thod : (27 “t (2) Working procedure for dual simplex me oe tei ends Step 1. (i) Convert the problem to maximization fo sie 50. : i to ($type by multiplying such ¢, (i) Convert (2) type constraints, ifany stra \ t ‘i i -1 5 : , (iii) Express the problem in standard form by introducing alec Variables, Step 2. Find the initial basic solution and express this information in the fom simplex table. n =e-Z,: Step 3. Test the nature of C= ¢;- 2; : (q) Ifall C,< 0 and all b, 2 0, then optimal basic feasible solution has been . 7 1 (@) fall G,<0 and at least one b; < 0, then go to step 4. ing (©) Ifany C,2 0, the method fails. Step 4. Mork the outgoing variable. Select the row that contains the most 4g, This willbe the key row and the corresponding basie variable is the outgoing vayighy Step 5. Test the nature of key row elements : ge (a) Ifall these elements are > 0, the problem does not have a feasible solution (0) Ifat least one element < 0, find the ratios of the corresponding elements org to these elements, Choose the smallest of these ratios. The corresponding column ig" column and the associated variable is the incoming variable. he Step 6. Iterate towards optimal feasible solution. Make the key element unity, Port row operations as in the regular simplex method and repeat iterations until either mal feasible solution is attained or there is an-indication of non-existence of a feasible, tion. e : Example 12.27. Using dual simplex method : > maximize ~ 3x, ~ 2x9, : : 2 subject to x, + x,2 1, x, 4%, $7, x, + 2,2 10, x, <3, x,20, X20. 2 : (Bombay, B. Teck, 2 Solution consists of the following steps : Step 1. (i) Convert the first and third constraints into (<) type. ~ ‘These constraints become % ot = 1,58, 247 <= 10, * (ti) Express the problem in standard for Introducing slack variables s,, 5,,,,-8, the. given problem takes the form Bx, — 2x + 05} + 0sy4.03p+08; 0° A =, -z, Polat ay 4sy=7, 8 2p Xp) 8p, 89) 8,8, 2 0- ariables 2, x, each equal to zero, we get the basic solute? Band z 20. Lsn= 7,5, Scanned with CamScanner ERA =F ET BRTV = G/ thay © swollen retin [ TINEAR PROGRAMMING a | ie a3 | Initial solution is given by the table below : 23 re e o : : o 0 4 - = ey s 8 6 o i _ os 1 0 0 0 -1 2 . : 1 0 1 0 0 7 : _ a Se o 0 1 0 -10e i 0 Ss y 1 0 0 0 1 3 | Pingel oe 9 0 ° ° 0 ° i Cae 8 -2 0 ° ° 0 : i i Step 3. Test nature of C, Since all C, values are < 0 and b, =~ 1, 6. jafeasible. We therefore, proceed further. Step 4. Mark the outgoing variable. Since b, is negative and numerically largest, the third row is the key row and s, is the outgoing variable. Step 5. Calculate ratios of elements in Crow to the corresponding negative elements of the key Tow. ‘These ratios are ~ 3/ 1 = 3, — 2/- 2 = 1 (neglecting ratios corresponding to + ve or zero elements of key row). Since the smaller ratio is 1, therefore, x,-column is the key column and (2) is the key element. Step 6. Iterate towards optimal feasible solution. ( Drop s, and introduce x, alongwith its associated value ~ 2 under cy column. Con- vert the key element to unity and make all other elements of the key column zero. Then the second solution is given by the table below : ~ 10, the initial solution is optimal but G -38 -2 0 0 0 oO . & Basis a eg ay 5 5 8 6 0 sy -2 0 a 0 ¥ 0 4 0 83 +: 0 0 1 4 0 2 -2 % } 1 0 0 t o 5 0 ge Sch (ee 9 2 ee 5 -2° 1 0. -10 Zj=Eepay = 1 2 0 0 G=e-Z, -2 0 0 0 =1 0 dat 8 + Since all C, values are < 0 and 6, = 2, this solution is optimal but infeasible. We therefore proceed further. (i) Mark the outgoing variable Since b, is negative, the fourth row is the key row and s, g (iii) Calculate ratios of elements in Crrow to the corresponding negative elem row, is the outgoing variable. ents of the Scanned with CamScanner (4) TOMERIGAL METHODS IN ENGINEER 2B 0, Zi i. hie rato is 2-4 = (ngreeting other Fab;O#COFFESPORTN LO Yop 9 ‘ his ratio is-4/- y =" “l ey row), nd (-) xycolumn is the ey column and (2, with its associa ERY ja the key element, ted value - 8 under the ¢ d introduce x; the key column 2421°°!¥m; foe eer and mae all ther elements of he key column 20. Thenly, solution is given by the table below : iy, ° ° 0 eo a Sy % Basis 8 4% 1 0 -1 Lf i 0 a 0 0 0 1 1 1 4 Ag 8 ; 0 OF ie 7 & t a 0 0 '-10 19 1 z 1 bg -2 0 0 3 4 4 é 7 0 0 0-3 ug oh 4 Since all C, values are < 0 and all b's are 2 0, therefore this solution is Ont feasible. Thus the optimal solution is ay 24,3) = Sand Zyg, = 18: WExample 12.28, Using dual simplex method, solve the following problem . Minimize Z = 2x, + 2x, + 4% subject to | 2x, + 3xy + 6x22, 3x, +X + 7% $3, x, + 4x + Br, <5, a a (Kerala, B, Teh, Solution consists of the following steps : Step 1. (i) Convert the given problem to maximization form by writing Maximize Z’ = - 2x, - 2x, - dry. (ii) Convert the first constraint into (<) type. Thus it is equivalent to = 2x, - Bx, — 5x, S$- 2 (iii) Express the problem in standard form, Introducing slack variables s,, s» sq, the giver problem becomes max, Z' = - 2r,~2x, ~ 4x, + 03, + Os, +084 subject to - Br, ~ Bx, ~5x,'+ 8, + 05, + 084 =~ 2, Bx, +x, + Tay +05, +5 , y+ dey + Bry +05, + 05, + 55 = 5, Xp Xp ty 8, 92 Step 2, Find the initial basic solution. Setting the decision variables x,, x,, x, each equal to zero, we get the base sit " 4%, =%, == 0,8, =-2, 8, =3, 8, =5 and Z’ =0. Initial solution is given by the table below : Sy 8p 20 Scanned with CamScanner (EAR PROGRAMMING ‘Step 3. Test nature of C, since all C; values are $0 and b, = Step 4. Mark the outgoing variable. Since 5, < 0, the fist row is the key row and s, is the outgoing variable. - ‘Step 5. Calculate the ratio of elements of C,-row to the corresponding negative elements ofthe key row. ‘These ratios are - Y- 2 = 1, - 2/3 = 0.67, - 4/-5 = 0.8. Since 0.67 is the smallest ratio, x,-column is the key column and (~3)is the key element. Step 6. Iterate towards optimal feasible solution. Drop s, and introduce x, with its associated value - 2 under cg colums. revised dual simplex table is 2, the initial solution is optimal but infeasible. Then the i ae ~2 =4 0 0 0 oe Basis x X xy 5, % 55 8 -2 * 2B 1 3 = 8 0 0 23 0 % 13 0 16/3 v3 1 0 U3 0 53 - 58 0 - 23 43 0 1 m8 Z; ~ 4/3 -2 - 10/3 23 0 0 - 43 G ~ 23 0 -23 = -28 0 0 optimal and feasible. Thus the Since all G S 0 and all 6; are > 0, this soluti optimal solution is = 0, x, = 2/3, x = 0 and max. Z’ min. Z = 4/3. ie. PROBLEMS 12.8 Using dual simplex method, solve the following problems : 1. Maximize Z = — 3x, — subject to x, +2 1, 2x, + Bx, 225x220. 2, Minimize Z = 2x, +x, subject to x, +229, 4x, + 8x,26,x, + 2x, $3,x,,%)20. (Kurukshetra, B. Tech, 2005) 3, Minimize Z =x, + 2r, + Sty, subject to 2xj — x, +45 24,%, + Hq + 2xy $8, xy — Hg? 25.4; 5 Xp, %g20- 4, Minimize Z = Gx, + 7x, + 3x, + Bry ‘ subject to Br, + 6x) - Bx, + dx, 2 12, x, + 5x, ~ Gr, 210, Dey + Bixy +25 +2428, Xp App ys %420- 5, Minimize Z = 8x, + 2x, +x, + 4, subject to 2x, + dry + Sx, + x42 10, 3x, ~ xp + Ty — 2x42 2, Bit, + Dey +9 + Gig 215, Xp Xp » Hy %420- a 12.14, (1) TRANSPORTATION PROBLEM’ This is a special class of linear programming problems in which the objective is to fanivert ‘a single commodity from various origins to different destinations at a minimum cost. fe Scanned with CamScanner

You might also like