The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called:
Show Hint
- feasible solutions
- constraints
- optimal solutions
- infeasible solutions
The Correct Option is B
Solution and Explanation
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.
Top Questions on 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
- Assertion (A): Every point of the feasible region of a Linear Programming Problem is an optimal solution.
Reason (R): The optimal solution for a Linear Programming Problem exists only at one or more corner point(s) of the feasible region.- CBSE CLASS XII - 2025
- Mathematics
- Linear Programming Problem
- A factory produces two products X and Y. The profit earned by selling X and Y is represented by the objective function \( Z = 5x + 7y \), where \( x \) and \( y \) are the number of units of X and Y respectively sold. Which of the following statements is correct?
- CBSE CLASS XII - 2025
- Mathematics
- Linear Programming Problem
- The optimal value of the linear programming problem
Maximise $z = 2x + 3y$
subject to
$5x + 4y ≤ 20,$
$ 3𝑥 + 5𝑦 ≤ 15,$
$ 2𝑥 + 𝑦 ≤ 4,$
$ 𝑥, 𝑦 ≥ 0,$
is- IIT JAM EN - 2024
- Mathematics for Economy
- Linear Programming Problem
Solve the following linear programming problem graphically:
Maximize \( z = x + y \), subject to constraints:
\[ 2x + 5y \leq 100, \quad 8x + 5y \leq 200, \quad x \geq 0, \quad y \geq 0. \]- CBSE CLASS XII - 2024
- Mathematics
- Linear Programming Problem
Questions Asked in CBSE CLASS XII exam
- Find the image \( A' \) of the point \( A(2,1,2) \) in the line \[ l: \mathbf{r} = 4\hat{i} + 2\hat{j} + 2\hat{k} + \lambda (\hat{i} - \hat{j} - \hat{k}). \] Also, find the equation of the line joining \( A A' \). Find the foot of the perpendicular from point \( A \) on the line \( l \).
- A die with numbers 1 to 6 is biased such that \( P(2) = \frac{3}{10} \) and the probability of other numbers is equal. Find the mean of the number of times number 2 appears on the die, if the die is thrown twice.
- CBSE CLASS XII - 2025
- Probability
- Solve the differential equation \( 2(y + 3) - xy \frac{dy}{dx} = 0 \); given \( y(1) = -2 \).
- CBSE CLASS XII - 2025
- Differential Equations
- A school is organizing a debate competition with participants as speakers and judges. \[ S = \{S_1, S_2, S_3, S_4\} \] where \(S = \{S_1, S_2, S_3, S_4\}\) represents the set of speakers. The judges are represented by the set: \[ J = \{J_1, J_2, J_3\} \] where \(J = \{J_1, J_2, J_3\}\) represents the set of judges. Each speaker can be assigned only one judge. Let \(R\) be a relation from set \(S\) to \(J\) defined as: \[ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} \]
- CBSE CLASS XII - 2025
- Relations and Functions
- Three persons, Amber, Bonzi, and Comet, are manufacturing cars that run on petrol and battery. Their production share in the market is:
- Amber: 60%
- Bonzi: 30%
- Comet: 10%
- Amber: 20%
- Bonzi: 10%
- Comet: 5%
- CBSE CLASS XII - 2025
- Probability