• Practice
  • About 16 min
  • 5 practice questions

Diet and blending problems at speed

Solve minimisation problems with several ≥ constraints, notice a redundant nutrient requirement, confirm the minimum on an unbounded region with a combination of constraints, and handle a fixed-total blend.

If something looks wrong, please tell us.

Diet and blending problems are the standard minimisation questions: meet some minimum requirements at the lowest cost. The region is unbounded, so the safe method has one more step than a maximisation problem. The figures below are illustrative.

The routine for a minimum

  • Let x and y be the amounts of the two foods or ingredients, and write Z as the cost.
  • Write one ≥ inequality for each nutrient or requirement.
  • Find the corner points by pairing the boundary lines; keep only those that satisfy every constraint.
  • Evaluate Z at each corner.
  • Confirm the least value with the combination test: find multipliers a, b ≥ 0 so that a(first) + b(second) matches the cost row; the right side then gives a lower bound.

On an unbounded region the corner with the smallest Z is a candidate. It is the minimum only if no feasible point has a smaller value, which you can prove by adding multiples of the constraints.

Worked example 1: three nutrients, one redundant

Food P costs ₹6 a unit and food Q costs ₹8 a unit. A diet needs at least 16 units of protein, 9 units of iron and 4 units of fibre. Each unit of P gives 4 protein, 1 iron and 1 fibre; each unit of Q gives 2 protein, 3 iron and 1 fibre. Minimise the cost.

Let x units of P and y units of Q be used. Minimise Z = 6x + 8y subject to 4x + 2y ≥ 16, x + 3y ≥ 9, x + y ≥ 4, x, y ≥ 0. The first two lines meet where 4x + 2y = 16 and x + 3y = 9: from the second x = 9 − 3y, so 36 − 12y + 2y = 16, giving y = 2 and x = 3. The corners are (0, 8), (3, 2) and (9, 0). At (3, 2) the fibre is 3 + 2 = 5 ≥ 4, at (0, 8) it is 8 and at (9, 0) it is 9, so the fibre constraint is redundant.

CornerZ = 6x + 8y
(0, 8)64
(3, 2)18 + 16 = 34
(9, 0)54

The smallest value is 34 at (3, 2). To confirm, take 1 × (4x + 2y ≥ 16) plus 2 × (x + 3y ≥ 9): 6x + 8y ≥ 16 + 18 = 34. So no feasible plan costs less: the minimum is ₹34, from 3 units of P and 2 of Q.

Worked example 2: a fixed total

A mixture of exactly 10 kg is made from grades A and B. It must contain at least 3 kg of A and at least 2 kg of B. Grade A costs ₹5 per kg and grade B ₹7 per kg. Find the cheapest and the dearest mix.

Let x kg of A and y kg of B be used. The total gives the equality x + y = 10, so the feasible points lie on a line segment, not a region. From y ≥ 2 we get x ≤ 8, and from x ≥ 3 we get y ≤ 7. The end points of the segment are (3, 7) and (8, 2). The cost is Z = 5x + 7y: at (3, 7) it is 15 + 49 = 64 and at (8, 2) it is 40 + 14 = 54. The cheapest mix is ₹54 (8 kg of A and 2 kg of B) and the dearest is ₹64. A shortcut: substituting y = 10 − x gives Z = 70 − 2x, which falls as x rises, so the minimum is at the largest allowed x = 8.

A quick test for the direction of the optimum

In a minimisation with positive costs, the cheapest plan lies on the part of the boundary closest to the origin. If the cost per unit of one food is much lower per nutrient, the optimum tends to lean towards it. In Worked example 1, 6x + 8y has slope −3/4, which lies between the slopes −2 (of 4x + 2y = 16) and −1/3 (of x + 3y = 9), which confirms the corner (3, 2) without a table.

Key takeaways: write a ≥ constraint for each requirement; discard constraints that every corner already satisfies; check the minimum by adding multiples of the constraints; a fixed total reduces the problem to one variable on a segment.

Check your understanding

  1. 1. 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
    Show answer

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

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

    1. ₹54
    2. ₹34
    3. ₹64
    4. ₹72
    Show answer

    Answer: A. Z = 6(9) + 8(0) = 54.

  3. 3. 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
    Show answer

    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.

  4. 4. 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
    Show answer

    Answer: B. x + y = 10 gives y = 10 − x.

  5. 5. 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
    Show answer

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

Privacy · Terms · Refunds · Delivery