Operations Research M: 7019944355
Need Answer Sheet of this Question paper Contact us at answersheethelp@gmail.com M: 7019944355 Operations Research Part One: 1. In case of (<=) inequality, to convert the inequality to an equation, we used to add a slack variable to the left hand side of the constraint, this slake variable should be: a. Negative b. Positive c. May be positive or negative d. Zero 2. In a set of m Χ n equations (m<n) the maximum number of corner points is given by………… 3. According to penalty rule for artificial variables, the objective coefficient of the artificial variable represents an appropriate penalty, positive or negative depending on the problem, but the necessary condition required to hold this is, the value should be: a. ∞ b. 0 c. 1 d. None of the above 4. The cases of the Simplex method in which the value of the variables may increased indefinitely without change in the constraints is: a. Degeneracy b. Alternative optima c. Unbounded ...