In a linear programming graph, the best (optimal) solution always occurs at a point called what?

In a linear programming graph, the best optimal solution always occur at a point called:

Extreme Point.

Step-by-step explanation:

As we know that the optimal solution is the solution that is a feasible solution and satisfies the objective function.

The objective solution always exist at the corner point of the feasible region and the objective function is either a minimization or a maximization function and hence such a point will is a objective solution is called a extreme point.

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!