MS 3053 Course:

Consider the linear program below and answer the following.

Max 1A 2B

s.t. 4A + 3B 6

1A 1B 5

A, B 0

a) I am asked to graph the feasible region for the problem.

b)Is the feasible region unbounded? Explain.

*The feasible region is unbounded because the solution coordinates may be made infinitely large without violating any of the constraints.

*The feasible region is unbounded because the value of the solution may be made infinitely large without violating any of the constraints.

*The feasible region is unbounded because more than one optimal solution occurs without violating any of the constraints.

*The feasible region is unbounded because the value of the solution violates at least one of the constraints.

*The feasible region is not unbounded.

(c) Find the optimal solution. (A, B) =

(d) Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded? *Yes *No

I am looking for detailed explanations on how to construct and solve, with NO steps left out, (as in working out each step thoroughly) Thank you!