Question: Question One a) Briefly explain the below terms Mathematical program. (2mks) cm Rank variables (2mks) ( Optimal solution. (2mks) b) Put the following program in
Question One a) Briefly explain the below terms Mathematical program. (2mks) cm Rank variables (2mks) ( Optimal solution. (2mks) b) Put the following program in standard forum Maximize: Z=5x1 + 2xx Subject to 6x1 + x26 4x, + 3x2212 X+2x, 24 With : X and X, nonnegative. (2mks) c) Briefly outline the simplex method. (6mks) 4) Use the dual simplex method to solve the following problem. (9mks) Maximize: Z=-2x, - 3X, Subject to: x, +X, 22 2x + x2 5 10 X+x, 58 With X and X, nonnegative Determine the symmetric dual of the below program. (3mks) Minimize : 2-5xl + 2x2 +x3 Subject to: 2x1 + 3x2 + x3 20 6x, +8x, + 5x, 230 7x + x + 3x, 240 X + 2x, + 4x, 2 50 With all valuables nonnegative Question Two a) State the duality theorem. (2mks) b) Briefly explain sensitivity analysis and the changes it seeks to investigate (5mks) Consider the following LP problem. (13mks) Maximize: Z=3x, + 2x2 + 4x, Subject to: 2x, +3X, - 2x, 512 X, + X2 + 2X, 510 With all variables nonnegative The optional simplex tableau for the standard forum of the above problem (with rank variables X4 and X5) Question One a) Briefly explain the below terms Mathematical program. (2mks) cm Rank variables (2mks) ( Optimal solution. (2mks) b) Put the following program in standard forum Maximize: Z=5x1 + 2xx Subject to 6x1 + x26 4x, + 3x2212 X+2x, 24 With : X and X, nonnegative. (2mks) c) Briefly outline the simplex method. (6mks) 4) Use the dual simplex method to solve the following problem. (9mks) Maximize: Z=-2x, - 3X, Subject to: x, +X, 22 2x + x2 5 10 X+x, 58 With X and X, nonnegative Determine the symmetric dual of the below program. (3mks) Minimize : 2-5xl + 2x2 +x3 Subject to: 2x1 + 3x2 + x3 20 6x, +8x, + 5x, 230 7x + x + 3x, 240 X + 2x, + 4x, 2 50 With all valuables nonnegative Question Two a) State the duality theorem. (2mks) b) Briefly explain sensitivity analysis and the changes it seeks to investigate (5mks) Consider the following LP problem. (13mks) Maximize: Z=3x, + 2x2 + 4x, Subject to: 2x, +3X, - 2x, 512 X, + X2 + 2X, 510 With all variables nonnegative The optional simplex tableau for the standard forum of the above problem (with rank variables X4 and X5)