For each statement specify whether it is True or False?

1. A local optimum is better than all nearby points.

2. An optimization problem can only have one local optimal solution.

3. A global optimum is the best point in the entire feasible region.

4. An optimization problem can only have one global optimal solution.

5. For linear optimization problems any local optimal solution is a global optimal solution.

6. For some nonlinear programming problems, Solver can get stuck at a local optimum and never find the global optimum.

7. For some linear programming problems, Solver can get stuck at a local optimum and never find the global optimum.

8. Solver is guaranteed to find the global optimum for convex nonlinear optimization problems.

9. A heuristic is a relatively simple solution method that often provides good but not necessarily optimal solutions.

10. MLP solver is a heuristic method.