Assuming we are given the formulation of a linear programming (LP) problem. To find the optimal solution of this LP problem, we are using the graphical method. if there is a point on the graph that satisfies all of the constraints at the same time, this point can be: An optimal solution point. At the intersection of the profit line and a constraint A corner point or at the intersection of two or more constraints. At the intersection of the nonnegativity constraints. All of the above None of the above

1. An optimal solution point.

2. At the intersection of the profit line and a constraint

3. A corner point or at the intersection of two or more constraints.

4. At the intersection of the nonnegativity constraints.

5. All of the above

6. None of the above