# Unbounded math program

The objective is not bounded on the feasible region  (from above, if maximizing; from below, if minimizing). Equivalently, there exists a sequence of feasible points, say $LaTeX: \textstyle x^k$ for which $LaTeX: \textstyle f(x^k)$ diverges to infinity (minus infinity if minimizing).