Question

Solve the linear programming problem 91 minimize w = 40J1 + 3092 + 20J3 + 1094 + 1095 J1 +293 +44 > 300 subject to yi +42 +295 400 +244 +Js > 1000 91,..., J5 20 ΛΙΛΙ ΛΙ 292

Answer 1

a Lopip w w = 404 + 3042 + 204 tloy, 7-197 solve - Min sub.tos yit 2y3+ y a 7,300 yty +245 > 400 242 + 2 y 4 & Ys > 1000 we can solve without using simplex abgouthm and find out solution the the optimal An matrix form the above system of an can be written as - A = 6 I O TTO T T o o 21 -16,42,43,44, de) Lo o o 2 1 . Hetot es=T01 here since solution Equal order of A is 3x5 . ire m=3, n = nom = -3 = 2 so the Basic are obtained by taking 2 variables to zero at a time. Now out of 5 variable & C₂ = 3/1 21 - S14 = 10 we

they have almost S. No. I Basic var Non Basic Vou. to basic solution Eqh of BS Basie son as F-of-Exeit / Barat z 2- 42 3-4 13-- .300 4 16300 2400 2500 yes_27000 ज 24221००० प |५ -५५-५ ५+2493-300 y = 100 400 INO -500 4 5 -10० ।। 3. 14 21000 - --150- ५८ -60 12401+1-300 मा १०० | | पू-व००५4%-500 4-500 120/५०० 42--५- ० ८ ४०० पात्र 300 ___4 पाप 22000 +24-4100 S1600114-y- LOD | 15om " 5-10०° 14-0 5. | |- - 2 = 150 18 2150 | - yes 24009-१०० ५. प्र . 341 12-=-400 - Yes 24. +244 112 -13:44 .+29-40 34--0 NO = 0 242+ 0p -०० - - 8. 93 94 9-12-1 + ५५=3015-- NO | 24- 500/4500 9. |93.35 48.5 | 50 __Yes 5-200 10. Ay- भ०१५4:300 5000 2015-20d Trence the optimal sole of the gren i popis Min = 6000 15-20 पाप-4470 S000

or му и tо 7 = 50 до а4 = зоо, Чs = 20 о 2 = 0, 42 20, из= 0