Answer Happy

0 Part A w that we want the format him to the new problem we be and decoration is bene che nel problem wees nice that old problem. ble region is ber and action value is worth old boom, ble region in water and analojeve tuval is more the old problem 2. Which one of the following manipulations can apply to replaces by negative variable .) to the problem, should replace by 4 where *20. b) In the problem, should replace by x + 4 where x 20 c) In the problem should replace by -- 4 where 320 d) In the problem, should replace by -*' +4 where x 20.(points) 3. Suppose that there is a variable say which it's cost coefficient defined as 5 + 3x * > 0 Which one of the following is its correct representation in a itxo minimization linear programming problem? (4 points) a) In the objective function () = 5x + 3 b) In the objective function cx) = 5x + 3 and and in the constraints OSX, S My = 0,11 in the constraints o su, M(-y). - 10.1 c) In the objective function d) In the objective function cx ) = 5x + 3y and x ) = 5x + 3(1- y) and in the constraints in the constraints os x S My., 10.11 OS X SM., 0.1) 4 What is the redundant constraint for a linear programming problem? (4 points) a) It is passes from ongin b) It is passed from a comer point c) It is parallel with objective function. d) It has not any effect on feasible region 3. Assume that 25*56. which one of the followings is binary representation of these constraints. points) a) 2x + 4y = 6, 7,. € 0.13 b) s(2), +(2)+(2), 56, you, y, € (0.1) c) 2, +4y, S6, y, € (0,13 d) }; + y + y + y + y = 6, P... Ya€ 0.1) 6. Which one is the following is not correct? (4 points) a) A binary variable can be just 0 and 1. b) The multiplayers of variables in the objective function are cost coefficient. c) An unbounded linear programming problem always has an unbounded optimal solution d) A BIP problem is a pure integer programming problem.