In linear programming, "unboundedness" refers to a situation where the objective function of the optimization problem can be increased or decreased indefinitely without violating the constraints. In other words, there is no upper or lower limit on the value of the objective function.