In an optimization problem, when different feasible solutions yield the same optimal value for the objective function, the problem has multiple optimal solutions. If a linear-programming problem has multiple optimal solutions, then such solutions correspond to extreme point solutions and their convex combinations.  Unique solution.