A linear programming problem is shown below.

$\begin{array}{ll} \text{Maximize} & 3x + 7y \\ \text{Subject to} & 3x + 7y \leq 10 \\ & 4x + 6y \leq 8 \\ & x, y \geq 0 \end{array}$

It has

- an unbounded objective function.
- exactly one optimal solution.
- exactly two optimal solutions.
- infinitely many optimal solutions.