Skip to content
Part BCSIR NET June 2025the-optimum-is-where-the-first-two-constraints-meet-not-the-first-and-third

The optimum is where the first two constraints meet not the first and third

Solve the following linear programming problem: maximize z = x + y subject to 5x + 3y ≤ 30, 2x + 6y ≤ 25, 2x − y ≤ 8, x ≥ 0, y ≥ 0. Then the optimal value of the objective function is

  1. A.45/11
  2. B.74/11
  3. C.85/12✓ Correct
  4. D.25/6

You have the answer. Trap Analysis is why the other three were written.

Not a worked solution repeated four times — the specific reasoning error each wrong option was built to reward, and why this one tests execution slip.

See pricing

50 are analysed free — try those first.

The trap it tests

Execution slip

The idea was right. The computation was not.

Drill statements like this

More on this topic

The chapter behind this: Linear programming, simplex and duality — free to read

From Linear Programming › Linear programming, simplex and duality

Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.

ShareWhatsAppTelegram