Consider the following linear program. Max 1A + 1B
s. t.
4A + 3B ≥ 24
2B ≥ 10
A, B ≥ 0
Does the linear program involve infeasibility, unbounded, and/or alternative optimal solutions? (Select all that apply.)
infeasibility
unbounded
alternative optimal solutions

Explain. (Select all that apply.)
The regions defined by the constraints do not overlap.
The first constraint allows the solution to be made infinitely large.
There are more than one solution for A and B which produce the optimal value for 1A + 1B.
The second constraint allows the solution to be made infinitely large.