Sunteți pe pagina 1din 3
(®) Optinmm simplex table of the following linear programming problem has ‘been given in the table:-1 ‘Maximize, Z = 60 X1+20 X +80 X Subjected1o, (6X14+3K2+45K3 < 750 3X +4K2+5K3 < 600 Xi. %.%20 ee. | me | oe | % | m | we 60, Xi 1 13 0 13, 1/3 50 30, x 0 T T As ws 0 Tables (If the RHS of the constraints changes to [750. 900]*. does it affect the optimum sohttion? If yes, then find the optimum solution using sensitivity samalysis approach. GIF coefficient of % in the constraints change to [1. 1]. does it affect the optimum solution? If yes, obtain the optimum solution using sensitivity analysis approach. (i) _ fnew constraint X,+Ky+Xs < 90 is added to the LP Problem, does it affect the optimum solution? If yes. obtain the optimum solution using sensitivity analysis approach. (a) Let, xsand 4 bethe output of models M,, My and Ms respectively. "The problem is stated under: Subieot 65,4 Be # Sm S750 Bap bdyy Sy 800 Baro Tosolve the problem by simplex method, slack variables and may be inroduced inthe given sonstaint ncaitie as fallows Maximise 26x, +20% + 8055+ 5, + 0S, Subject bx) # 38, FSS) = 750 Bay big FS 55-600 wus The solution i given in Tables 4.18 thi 4.20 TABLE 4.18 Simplex Tableau 1: Non-sotimal Salution Basis H a a s S 5 Do sof 3 4 s © 1 oo noe 5 «@ 0 © ° o Soliton o 0 180 0 @ + TABLE 4.19 Simplex Taoloas 2: Non-optimal Solution Basie s 5 Si. a ily 5 of >» 4 ° 1 =il 10 sO ss] 35 4s t ° 1s 120 200 Solution o mm 180 ° 4 n 4 ° ° 16 1 TABLE 4.20 Simplex Taoleay 3: Optimal Solution Bale ft 4 5 S S ® 4 0 1 us 0 us us se “Thus, optimal solution is 4, 50 units and Af: 90 units, The maximum profit odstinable is Rs 10.200,

S-ar putea să vă placă și