Skip to content
Part CCSIR NET December 2024chain-the-constraints-to-bound-the-objective

Chain the constraints to bound the objective

Consider maximizing the objective function P=x1+2x2+3x3P = x_{1} + 2x_{2} + 3x_{3} subject to x1+x2≤5,x2+x3≤2,x1+x2+x3≤6,x1≥0,x2≥0,x3≥0x_{1} + x_{2} \le 5, x_{2} + x_{3} \le 2, x_{1} + x_{2} + x_{3} \le 6, x_{1} \ge 0, x_{2} \ge 0, x_{3} \ge 0. Then, which of the following statements are true?

  1. A.(5, 0, 1) is a corner point.✓ Correct
  2. B.(4, 1, 1) is an optimal point.
  3. C.The optimal solution is 9.
  4. D.The optimal solution is 10.✓ Correct

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