Answer Happy

Question 2 a) Consider the following linear programming problem: Maximum = 2x: + 4x2 +2255 x1 + xy S4 x 20 (1) Create the initial simplex tableau (11) Using the simplex method, examine and solve the problem Major Topic Score Blooms Designation AN LP: Simplex Method 7 Ratio 20 40 b) The following tableau represents a specific simplex iteration Iteration Basic Xi X2 Si S2 RHS variable 0 0 Si 1 2 1 1 0 40 s. 4 4 3 0 52 0 1 120 Z z -40 -50 0 0 0 0 1 1 X2 0.5 1 0.5 0 20 S2 2.5 0 -1.5 1 60 Z -15 0 25 0 1000 2 2 X 0 1 1 0.8 -0.2 8 X 1 0 -0.6 0.4 24 Z 0 0 16 6 1360 40 24 3 (0) Analyzing the tableau, can we say the solution to this problem is optimal at iteration 1? Explain ? (1) Categorize the variables as Basic and non-Basic, and provide the current values of all the Variables. (H) In your identification of the basic and non-Basic variables, determine the associated leaving variable if each such variable enters the basic solution. Major Topic Blooms Score Simplex Method: Basic and Non-Basic variable Designation 7 7 EV c) Consider the following problem. Maximum 2 = 2x: +31 2x1 + x354 9, +423 55 13, 120 i) Construct the dual problem. (a) Graph the dual problem Major Topic Score Blooms Designation EV Duality Theory 6 d) Explain why the utilization factor p for the server in a single-server queueing system must equal 1-Po, where Po is the probability of having customers in the system Major Topic Score Blooms Designation AP Introduction To Queueing Theory 5 TOTAL SCORE: 25