Find the optimal solution and optimal value of the following linear program. Use both (a) the enumerating the corner points method and (b) the iso-profit line method. Also identify the binding and non-binding constraints and the slack of each constraint. Show all work.
minimize 2XI + X2
subject to
6XI + 12x2 > 64
Xl > 0
X2 > -3