There are three outcomes in linear optimization, as follows:
- A local optimal solution to a linear program is a feasible solution with a closer objective function value than all other feasible solutions close to it. It may or may not be the global optimal solution, a solution that is better than every feasible solution.
- A linear program is infeasible if a solution cannot be found.
- A linear program is unbounded if the optimal solution is unbounded or is infinite.