IFIM BUSINESS SCHOOL

BENGALURU -560 100

1.

MID TERM EXAMINATIONS AUGUST 2019

POST GRADUATE DIPLOMA IN MANAGEMENT
BATCH 2018-20 (TERM-IV)
Subject & Code: Operations Research (G-302)
Duration: 120 minutes Max. Marks: 40
Instructions to the students:
1. Answer all the questions.
2. All are of 1 mark.
3. No Negative Marking.

1. Which of the following statements is true?

a. Changing the RHS of a constraint changes its slope.
b. A less than or equal to constraint with positive slack in the optimal solution will always have an
infinite allowable decrease for the RHS.
c. Increasing the RHS of a less than or equal to constraint will eventually make it redundant.
d. An optimal solution will never use up all of the resources available.
2. Let x = number of units of product 1 to produce and let y = number of units of product 2 to produce.
Consider the following objective function: Maximize z = x + 2y. Subject to the following constraints: x + y
≤ 12 (resource A), x ≤ 8 (resource B), y ≤ 6 (resource C), x and y ≥ 0. What will the optimal objective
function value be?
a. 10
b. 18
c. 16
d. 12
3. Refer to Question #3. Suppose the amount resource A available is increased from 12 to 14. Now what
will the optimal objective function value be?
a. 16
b. 20
c. 24
d. 18
4. Refer to Question #3. Suppose the amount resource B available is increased from 8 to 10. Now what will
the optimal objective function value be?
a. 18
b. 22
c. 20
d. 16
5. Refer to Question #3. What is the shadow price for the resource C constraint?
a. 1
b. 2
c. 3
d. 0
6. Which of the following statements is true?
a. An equality constraint is always nonbinding.
b. Shadow prices can be found in the Answer Report.
c. If a constraint is nonbinding then its LHS is greater than its RHS.
d. Changes to an objective function coefficient will not affect the size of the feasible region.

Page 1 of 6
7. Suppose that a MAX problem contained the following constraint: 5x + 8y ≤ 40. Then which of the
following statements is true?
a. For the point (1, 4), the slack for this constraint would have a value of 3.
b. For the point (8, 5), the slack for this constraint would have a value of 40.
c. For the point (4, 2.5), the slack for this constraint would be a positive value.
d. For the point (4, 2), the slack for this constraint would be zero.
8. If a greater than or equal to constraint is used to model a minimum requirement constraint, then:
a. it will always be a binding constraint if the objective function is a MAX.
b. it will be a binding constraint if the minimum requirement is exceeded.
c. it will be a binding constraint if the minimum requirement is exactly met.
d. it will always be a binding constraint if the objective function is a MIN.
9. Any change in the values for the RHS (Right Hand Side) of a binding constraint of an LP problem will:
a. not change the feasibility region
b. not change the slope of the constraint but move it parallel to the original
c. change the slope of the objective function
d. change the slope of the that constraint
10. The shadow price is calculated to be 3 for a less than or equal to constraint in a maximization LP problem,
this means:
a. if the RHS for that constraint is increased by one then the optimal objective function value is increase
by 3 dollars
b. if the coefficient of the objective function is increase by 1 then the RHS for that constraint must be
increased by 3.
c. if the coefficient of the objective function is increase by 3 then the RHS for that constraint must be
increased by 1.
d. if the RHS for that constraint is increased by three then the optimal objective function value is
increase by 1 dollars
11. A non-binding constraint;
a. has a non-zero shadow price
b. has a zero shadow price
c. the slack for that constraint is zero
d. mean that all the resources for that constraint are used.
12. Which of the following statements is true?
a. An IP solution can be better than the LP solution to the same problem.
b. Rounding does not necessarily provide feasible solutions and feasible solutions from rounding are
not necessarily optimal.
c. In general, it is no more difficult to solve an IP than an LP.
d. Suppose X1 and X2 are both binary variables where Xi = 1 if a plant is built at location i. The
constraint "a plant can be built at location 2 only if the plant at location 1 is also built" is represented
by X1 ≤ X2.
13. Which of the following statements is true?
a. In the Branch-and-Bound method, stop branching when the objective function value for a branch is
greater than or equal to the best integer-valued solution found so far.
b. In a pure IP problem all decision variables must be either 0 or 1 in the optimal solution.
c. In a mixed IP problem only some of the decision variables are restricted to integer amounts.
d. Rounding an optimal solution to the nearest integers will provide a feasible solution.
14. Suppose 𝑋𝑖 (𝑖 = 1, 2) is 1 if department 𝑖 is expanded and 0 if department 𝑖 is not expanded. What
constraint is needed to ensure that if one department is expanded then both will be expanded?
a. X1 − X2 ≤ 0
b. X1 − X2 = 0
c. X1 + X2 ≤ 2
d. X1 − X2 ≥ 0

Page 2 of 6
15. Suppose 𝑋𝑖 (𝑖 = 1, 2) is 1 if project 𝑖 is selected and 0 if project 𝑖 is not selected. To ensure that project
1 cannot be selected unless project 2 is also selected, one would include which of the following
constraints?
a. X1 + X2 = 1
b. X1 − X2 ≤ 0
c. X1 + X2 ≤ 1
d. X1 − X2 = 1
16. In a Branch-and-Bound problem, if X1 = 5 and X2 = 3.7, then which of the following would be a possible
branching option?
a. X2 ≥ 4
b. X1 ≤ 5
c. X2 ≤ 4
d. X2 ≥ 3
17. Let P1 equal the number of units of Product 1 to produce. Assume that either 𝑃1 = 0 𝑜𝑟 𝐿 ≤ 𝑃1 ≤
𝑈. If 𝑌 is a binary variable, then which of the following constraints model the above condition?
a. P1 − UY ≥ 0 and P1 − LY ≤ 0
b. P1 + UY ≤ 0 and P1 − LY ≥ 0
c. P1 − UY ≤ 0 and P1 − LY ≥ 0
d. P1 + LY ≤ 0 and P1 − UY ≥ 0
18. A decision-maker wishes to choose at least two projects out of a total of five. The appropriate constraint
is:
a. X1 + X2 + X3 + X4 + X5 > 2
b. X1 + X2 + X3 + X4 + X5 = 2
c. X1 + X2 + X3 + X4 + X5 ≥ 2
d. X1 + X2 + X3 + X4 + X5 ≤ 2
19. If the solution to the problem requires all the optimal values to be integers then rounding off the optimal
solution to the non-integer problem is
a. may be either a feasible point or infeasible point
b. always a feasible point and the optimal point
c. always a feasible point
d. always feasible but not optimal
20. Which of the following is a linear equation for the variables A and B?
a. 2A + 3AB2 = 12
b. 2A + 3AB = 11
c. 2A2 + 3B = 12
d. 2A + 3B = 5B − 1
21. What kind of constraint can be added or deleted from a linear programming model without changing the
feasible region?
a. Redundancy
b. Resource availability
c. Nonnegativity
d. Equality
22. The graphical solution method is used for solving linear programming model with how many decision
variables?
a. 2
b. 1
c. 4
d. 3
23. Solutions that satisfy all constraints at the same time are called:
a. optimal.
b. feasible.

Page 3 of 6
 c. redundant.
d. nonnegative.
24. Which of the following statements is true?
a. A linear programming model will always have at least one optimal corner point.
b. A linear programming model always has at least two constraints.
c. All functions in an LP model must be linear.
d. A linear programming model will always have nonnegativity constraints.
25. All the intersection points of all the constraints are:
a. some of the intersections are corners of the feasible region
b. all are feasible points
c. all the corners of the feasible region
d. all are infeasible points
26. One constraint of a two-decision variable LP problem is 3T+ 4C ≤ 2400. The point (300, 400), that is T
= 300 and C = 400 is:
a. a corner point of the feasible region
b. a solution with regard to 3T+ 4C ≤ 2400
c. not a solution with regards to 3T+ 4C ≤ 2400
d. a point on the line of constraint 3T+ 4C ≤ 2400
27. Two constraints of two decision variable LP problem are 2𝑇 + 3𝐶 ≤ 1800 and 𝑇 + 2𝐶 ≤ 1100.
The point (300, 400), that is 𝑇 = 300 and 𝐶 = 400 is certainly:
a. a point that is not in the feasible region of the LP problem
b. an intersection point of the two gives constraints so it may be a corner point.
c. a corner point of the feasible region
d. a point in the feasible region
28. Which of the following is not a requirement for a goal programming problem?
a. prioritization of goals
b. a single objective function
c. linear constraints
d. linear objective function
e. none of the above
29. If we wish to develop a stock portfolio wherein we maximize return and minimize risk, we would have to
use
a. Pure integer programming.
b. Goal programming.
c. Zero-one integer programming.
d. mixed-integer programming.
e. nonlinear programming.
1
30. Select the appropriate Lagrangian function for the optimisation problem. 𝑀𝑎𝑥 𝑓(𝑥, 𝑦) = − 2 𝑥 2 +
2𝑥𝑦 + 𝑦 2 − 6𝑦 − 10 such that: 𝑥 2 + 𝑦 2 ≤ 10.
1
a. L(x, λ) = − 2 𝑥 2 + 2𝑥𝑦 + 𝑦 2 − 6𝑦 − 10 + λ (𝑥 2 + 𝑦 2 – 10) ;
1
b. L(x, λ) = 2
𝑥 2 − 2𝑥𝑦 − 𝑦 2 + 6𝑦 + 10 + λ( 𝑥 2 + 𝑦 2 – 10) ;
1 2
c. L(x, λ) = − 2
𝑥 + 2𝑥𝑦 + 𝑦 2 − 6𝑦 − 10 + λ( 𝑥 2 + 𝑦 2 + 𝑠 2 – 10) ;
1 2
d. L(x, λ) = 2
2𝑥𝑦 − 𝑦 2 + 6𝑦 + 10 + λ (𝑥 2 + 𝑦 2 + 𝑠 2 − 10) .
𝑥 −
e. None of the above.
31. Assume both 𝐴, 𝐵 ⊂ 𝑅 𝑛 . Which of the following statements is true?
a. If 𝐵 ⊂ 𝐴, then 𝑚𝑎𝑥𝑥∈𝐴 𝑓(𝑥) ≤ 𝑚𝑎𝑥𝑥∈𝐵 𝑓(𝑥);
b. If 𝐵 ⊂ 𝐴, then 𝑚𝑖𝑛𝑥∈𝐴 𝑓(𝑥) ≥ 𝑚𝑖𝑛𝑥∈𝐵 𝑓(𝑥);
c. If 𝐴 ⊂ 𝐵, then 𝑚𝑎𝑥𝑥∈𝐵 𝑓(𝑥) ≤ 𝑚𝑎𝑥𝑥∈𝐴 𝑓(𝑥);

Page 4 of 6
 d. If 𝐴 ⊂ 𝐵, then 𝑚𝑖𝑛𝑥∈𝐴 f(x) ≥ 𝑚𝑖𝑛𝑥∈𝐵 f(x);
e. None of the above
32. We need to enclose a field with a fence. We have 500 feet of fencing material with a building on one side
of the field where we will not need any fencing. Determine the maximum area of the field that can be
enclosed by the fence.
a. x=125, y=250
b. x=150, y=200
c. x=125, y=100
d. x=200, y=150
33. Determine the gradient of the function 𝑥 2 − 2𝑦 2 − 4𝑦 + 6 at point (0, 0)?
a. ∇𝑓 = 2𝑖 − 4𝑗
b. ∇𝑓 = 0𝑖 − 4𝑗
c. ∇𝑓 = 0𝑖 + 0𝑗
d. ∇𝑓 = −4𝑖 − 4𝑗
34. The heat transfer rate q over a surface is given by
𝑑𝑇
𝑞 = −𝑘𝐴 , where
𝑑𝑦
𝑘 = 𝑡ℎ𝑒𝑟𝑚𝑎𝑙 𝑐𝑜𝑛𝑑𝑢𝑐𝑡𝑖𝑣𝑖𝑡𝑦 (𝐽/𝑠 − 𝑚 − 𝐾) ,
𝐴 = 𝑠𝑢𝑟𝑓𝑎𝑐𝑒 𝑎𝑟𝑒𝑎 (𝑚2),
𝑇 = 𝑡𝑒𝑚𝑝𝑒𝑟𝑎𝑡𝑢𝑟𝑒 (𝐾),
𝑦 = 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑛𝑜𝑟𝑚𝑎𝑙 𝑡𝑜 𝑡ℎ𝑒 𝑠𝑢𝑟𝑓𝑎𝑐𝑒,
the temperature 𝑇 over the surface varies as
𝑇 = −1493𝑦 3 + 2200𝑦 2 − 1076𝑦 + 500,
𝑘 = 0.025 (𝐽/𝑠 − 𝑚 − 𝐾),
𝐴 = 3 𝑚2

The heat transfer rate q in Watts at the surface most nearly is

a. -1076
b. 37.5
c. 80.7
d. 500
35. An initial estimate of an optimal solution is given to be used in conjunction with the steepest ascent
method to determine the maximum of the function. Which of the following statements is correct?
a. The function to be optimized must be differentiable.
b. If the initial estimate is different than the optimal solution, then the magnitude of the gradient is
nonzero.
c. As more iterations are performed, the function values of the solutions at the end of each subsequent
iteration must be increasing.
d. All 3 statements are correct.
36. For the constraints given below, which point is in the feasible solution space of a maximization problem
of a non-negativity LP model?
(1) 14𝑥 + 6𝑦  42
(2) 𝑥 − 𝑦 ≤ 3
a. x = 1, y = 5
b. x = -1, y = 1
c. x = 4, y = 4
d. x = 2, y = 1
e. x = 2, y = 8
37. If in LPP, the solution of a variable can be made infinity large without violating the constraints, the solution
is:
a. Infeasible

Page 5 of 6
 b. Unbounded
c. Alternative
d. None of the above
38. If an artificial variable is present in the basic variable column of optimal simplex table then the solution
is
a. Solution is unbounded
b. Solution is infeasible
c. Degenerate
d. None of the options
39. Alternative solutions exist of an LP model when
a. one of the constraints is redundant.
b. objective functions equation is parallel to one of the constraints.
c. two constraints are parallel.
d. All the options
40. While solving a LP problem, infeasibility may be removed by
a. Adding another constraint
b. Adding another variable
c. Removing a constraint
d. Removing a variable

Page 6 of 6