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 2X_{I} + X_{2}
subject to
6X_{I }+ 12x_{2} > 64
X_{l} > 0
X_{2} > -3