a) Any LP that has an optimal solution has either a unique optimal solution, or infinitely many optimal solutions. b) An optimal solution can exist in an unbounded feasible region. c) Any linear programing can be solved by graphical approach. If a linear program has a unique solution, then the solution must be a corner point. d) The reduced cost for a decision variable with a positive value is also positive. e) The dual price for a nonbinding constraint is 0