In a maximization problem, when one or more of the solution variables and the profit can be made infinitely large without violating any constraints, the linear program has
a. an infeasible solution
b. an unbounded solution
c. a redundant constraint
d. alternate optimal solutions
e. none of the above