Question:medium
The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called:
The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called:
Show Hint
Understand the difference between constraints and feasible/optimal solutions in linear programming.
Updated On: Jan 13, 2026
- feasible solutions
- constraints
- optimal solutions
- infeasible solutions
Show Solution
The Correct Option is B
Solution and Explanation
Step 1: Define constraints in linear programming
Constraints are conditions or restrictions placed on decision variables (e.g., \( x, y \)) within a linear programming problem. They generally signify limitations related to resources or other requirements.
Step 2: Identify from options
(A) Feasible solutions: These satisfy all constraints but are not the constraints themselves.
(B) Constraints: These are restrictions on decision variables, and this option correctly identifies them.
(C) Optimal solutions: These optimize the objective function but are not constraints.
(D) Infeasible solutions: These do not meet all constraints.
Step 3: Conclude the result
Such restrictions are termed constraints.
Was this answer helpful?
0
Top Questions on Linear Programming Problem
- The feasible region of the linear programming problem is determined by the system of inequalities: \[ x + y \leq 6, \quad x \geq 0, \quad y \geq 0. \] What is the maximum value of \( x + y \) in the feasible region?
- MHT CET - 2025
- Mathematics
- Linear Programming Problem
- Solve the following linear programming problem graphically: \[ \text{Minimise } Z = 2x + y \] subject to the constraints: \[ 3x + y \geq 9, \] \[ x + y \geq 7, \] \[ x + 2y \geq 8, \] \[ x, y \geq 0. \]
- CBSE Class XII - 2025
- Mathematics
- Linear Programming Problem
- In a Linear Programming Problem, the objective function $Z = 5x + 4y$ needs to be maximised under constraints $3x + y \leq 6$, $x \leq 1$, $x \geq 0$, $y \geq 0$. Express the LPP on the graph and shade the feasible region, and mark the corner points.
- CBSE Class XII - 2025
- Mathematics
- Linear Programming Problem
- Consider the Linear Programming Problem, where the objective function \[ Z = x + 4y \] needs to be minimized subject to the following constraints: \[ 2x + y \geq 1000, \] \[ x + 2y \geq 800, \] \[ x \geq 0, \quad y \geq 0. \] Draw a neat graph of the feasible region and find the minimum value of $Z$.
- CBSE Class XII - 2025
- Mathematics
- Linear Programming Problem
- Want to practice more? Try solving extra ecology questions todayView All Questions
