Step 1: Define constraints in linear programming
Constraints are the conditions or restrictions imposed on decision variables (e.g., \( x, y \)) in a linear programming problem.
They typically represent limitations on resources or other requirements.
Step 2: Identify from options
(A) Feasible solutions: These are solutions satisfying all constraints, but they are not the constraints themselves.
(B) Constraints: These are restrictions on decision variables, and this is the correct answer.
(C) Optimal solutions: These maximize or minimize the objective function but are not constraints.
(D) Infeasible solutions: These do not satisfy all constraints.
Step 3: Conclude the result
The restrictions are called constraints.
Assertion (A): The shaded portion of the graph represents the feasible region for the given Linear Programming Problem (LPP).
Reason (R): The region representing \( Z = 50x + 70y \) such that \( Z < 380 \) does not have any point common with the feasible region.
In a Linear Programming Problem (LPP), the objective function $Z = 2x + 5y$ is to be maximized under the following constraints: 
\[ x + y \leq 4, \quad 3x + 3y \geq 18, \quad x, y \geq 0. \] Study the graph and select the correct option.