The region which satisfies all of the constraints in graphical linear programming is called the

A) area of optimal solutions.
B) area of feasible solutions.
C) profit maximization space.
D) region of optimality.
E) region of non-negativity.

Feasible Solutions

A set of solutions that meet all the constraints of a particular problem, available for consideration in decision-making processes.

Graphical Linear Programming

A method for solving linear programming problems by graphically finding the optimum point that maximizes or minimizes the objective function.

Constraints

Limitations or restrictions in a manufacturing or production process, which can affect the efficiency or outcomes.