Linear Programming

Practice questions

Together with x ≥ 0 and y ≥ 0, which pair of inequalities has NO feasible point?

  1. x + y ≤ 3 and x ≥ 1
  2. x + y ≥ 3 and x ≤ 1
  3. x ≤ 2 and y ≥ 5
  4. x + y ≤ 3 and x + y ≥ 4
Answer and explanation

Answer: D

x + y cannot be at most 3 and at least 4 at the same time, so that region is empty. The others have points: (1, 0) for x + y ≤ 3 with x ≥ 1, (0, 3) for x + y ≥ 3 with x ≤ 1, and (0, 5) for x ≤ 2 with y ≥ 5.

A student finds, for maximising Z = 3x + 4y, the corner values 0, 18, 28 and 32 and reports 18. The error is:

  1. a wrong sign in a constraint line
  2. reporting a corner that is not the largest
  3. using the wrong objective function
  4. forgetting to test the origin point
Answer and explanation

Answer: B

For a maximum the greatest corner value, 32, must be reported, not 18.

In Worked example 3, adding x ≤ 5 leaves the maximum unchanged. Why?

  1. x ≤ 5 is a ≥ constraint
  2. (6, 0) is the optimum
  3. Z has no x term
  4. (0, 8) satisfies x ≤ 5
Answer and explanation

Answer: D

x = 0 ≤ 5, so the old optimum remains feasible, and an optimum that survives stays optimal.

In Worked example 2, why does adding y ≤ 6 lower the maximum?

  1. the new constraint is redundant
  2. the old optimum (0, 8) is cut off
  3. (2, 6) is not a corner
  4. the objective changes
Answer and explanation

Answer: B

The old optimum has y = 8, which violates y ≤ 6. The best remaining corner gives 30, lower than 32.

After adding a new constraint to a maximisation problem, the maximum value:

  1. is always larger than before
  2. is always unchanged by it
  3. is not larger than before
  4. is always smaller than before
Answer and explanation

Answer: C

The new region lies inside the old one, so the maximum cannot rise. It may stay the same or fall.

For the problem in Worked example 1, is the plan (4, 4) feasible?

  1. yes, and it is a corner
  2. no, it breaks x + y ≤ 8
  3. no, it breaks 2x + y ≤ 12
  4. yes, and it is the maximum
Answer and explanation

Answer: A

4 + 4 = 8 ≤ 8 and 2(4) + 4 = 12 ≤ 12, so it is feasible and both constraints are binding. But Z = 28 is less than 32 at (0, 8).

In the advertising problem, what is Z at (8, 5)?

  1. 77
  2. 69
  3. 71
  4. 56
Answer and explanation

Answer: C

Z = 7(8) + 3(5) = 56 + 15 = 71.

In the advertising problem, the budget constraint 20x + 10y ≤ 230 simplifies to:

  1. 2x + y ≤ 23
  2. x + 2y ≤ 23
  3. 2x + y ≤ 230
  4. 2x + y ≥ 23
Answer and explanation

Answer: A

Divide by 10: 2x + y ≤ 23.

In the farm problem, which constraints are binding at the best plan?

  1. labour and minimum wheat
  2. land only
  3. land and labour
  4. none of them
Answer and explanation

Answer: C

At (10, 10), 10 + 10 = 20 and 30 + 50 = 80, so land and labour are both exactly used.

In the farm problem, what is the profit at (20, 0)?

  1. ₹9,000
  2. ₹8,000
  3. ₹4,000
  4. ₹10,000
Answer and explanation

Answer: B

Z = 400(20) + 500(0) = 8,000.

In the farm problem, what is the corner where x = 4 meets the labour line 3x + 5y = 80?

  1. (4, 16)
  2. (4, 12.8)
  3. (16, 4)
  4. (4, 13.6)
Answer and explanation

Answer: D

12 + 5y = 80 gives 5y = 68, so y = 13.6.

If the cost is Z = 5x + 7y and x + y = 10, what is Z in terms of x?

  1. 70 − 2x
  2. 70 + 2x
  3. 50 + 7x
  4. 35 − 2x
Answer and explanation

Answer: A

Z = 5x + 7(10 − x) = 5x + 70 − 7x = 70 − 2x.

For a 10 kg blend with x kg of A and y kg of B, what constraint do we substitute to reduce the problem to one variable?

  1. y = x − 10
  2. y = 10 − x
  3. y = 10x
  4. y = 10 + x
Answer and explanation

Answer: B

x + y = 10 gives y = 10 − x.

Why was x + y ≥ 4 redundant in Worked example 1?

  1. it has a negative coefficient
  2. it passes through the origin
  3. it is parallel to the objective
  4. every corner already satisfies it
Answer and explanation

Answer: D

The sums x + y at the three corners are 8, 5 and 9, all at least 4, so removing it does not change the region.

In Worked example 1, what is the cost at the plan (9, 0)?

  1. ₹54
  2. ₹34
  3. ₹64
  4. ₹72
Answer and explanation

Answer: A

Z = 6(9) + 8(0) = 54.

A diet needs at least 20 units of protein. One unit of food X gives 5 protein. Which constraint is written correctly, with x units of X and y units of another food that gives 2 protein per unit?

  1. 5x + 2y ≤ 20
  2. 5x − 2y ≥ 20
  3. 5x + 2y ≥ 20
  4. 2x + 5y ≥ 20
Answer and explanation

Answer: C

Total protein is 5x + 2y, and it must be at least 20.

In the diet region with corners (0, 8), (3, 2) and (9, 0), the constraint x + y ≥ 4 is:

  1. binding at the corner (3, 2) itself
  2. violated at the corner (9, 0) here
  3. an equality constraint on the region
  4. redundant: x + y is at least 5 here
Answer and explanation

Answer: D

The sums x + y at the corners are 8, 5 and 9, and x + y only grows along the directions in which the region is unbounded, so x + y ≥ 5 throughout and removing the constraint changes nothing.

How many points with whole-number coordinates satisfy x ≥ 0, y ≥ 0, x + y ≤ 4?

  1. 10
  2. 16
  3. 15
  4. 20
Answer and explanation

Answer: C

For x = 0, 1, 2, 3, 4 there are 5, 4, 3, 2, 1 values of y. The total is 15.

Using the shoelace method, what is the area of the triangle with corners (0, 0), (4, 0), (0, 6)?

  1. 12
  2. 24
  3. 10
  4. 6
Answer and explanation

Answer: A

The terms are 0·0 − 4·0 = 0; 4·6 − 0·0 = 24; 0·0 − 0·6 = 0. The sum is 24, so the area is 12.

A region contains the interior point (1, 1), and one boundary is the line 3x + 2y = 18. Which inequality describes it?

  1. 3x + 2y ≥ 18
  2. 3x + 2y = 5
  3. 3x − 2y ≤ 18
  4. 3x + 2y ≤ 18
Answer and explanation

Answer: D

At (1, 1) the left side is 5, which is less than 18, so the region is on the ≤ side.

Privacy · Terms · Refunds · Delivery