Explain it

13-linear-inequalities-programming — 2 short write-ups

Question 1 of 2

A checkpoint, not a test

Explain shading and feasibility

A short written check using original parallel practice. This is portal practice, not a Canvas course grade.

For 2x + y ≤ 8, explain whether the boundary is solid or dashed and how testing (0, 0) determines the shaded side. If x ≥ 1 is also required, is (0, 0) feasible for the whole system? Explain.

A point can pass one inequality and fail the system.

Question 2 of 2

A checkpoint, not a test

Explain the corner comparison

A short written check using original parallel practice. This is portal practice, not a Canvas course grade.

A nonempty closed bounded feasible polygon has corners (0, 0), (5, 0), (3, 4), and (0, 4). Maximize P = 4x + 3y. Give all four corner values, identify the maximizing point and value, and explain why comparing these corners is sufficient.

Use each ordered pair in the objective; the best x-coordinate alone does not settle it.