Skip to content
Part CCSIR NET December 2024a-non-negative-sum-bounded-above-by-zero

A non negative sum bounded above by zero

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

  1. A.The optimal solution is 4.
  2. B.An optimal point is (4, 1, 0).
  3. C.The optimal solution is 6.
  4. D.(1/2, 0, 0) is a corner point.✓ 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 boundary and endpoint.

See pricing

50 are analysed free — try those first.

The trap it tests

Boundary and endpoint

The statement turns at the edge of the interval, the domain, or the parameter range.

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