In linear programming, the primary difference is that an unbounded solution means the objective function can be improved infinitely, while an infeasible solution means no solution exists that satisfies all constraints.

Unbounded: feasible solutions exist, but the objective value can increase or decrease indefinitely.

Infeasible: no solution satisfies all the constraints.

An unbounded solution means the feasible region exists, but the objective function can improve without limit. For example, profit can keep increasing indefinitely.

An unbounded solution has feasible solutions, but the objective value can increase or decrease without limit. An infeasible solution has no feasible solution because the constraints conflict with each other.