SOLVER7 Study. Nothing Else.
2024 Board Paper Q10

The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called : (A) feasible solutions (B) constraints (C) optimal solutions (D) infeasible solutions

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you want to bake as many cookies as possible. But you only have a fixed amount of flour and sugar. Those limits — how much flour, how much sugar you have — are the rules you must follow. In a maths problem about maximising or minimising something, these rules are called constraints. They stop the answer from going beyond what is actually possible. Just like you cannot bake more cookies than your ingredients allow, the decision variables in a problem cannot go beyond what the constraints permit.

Answer: The correct answer is (B) constraints.

📖 Understanding Constraints in Linear Programming

Detailed Explanation

In a Linear Programming Problem (LPP), we try to maximize or minimize a linear function called the objective function, for example \( Z = ax + by \). Here \( x \) and \( y \) are the decision variables. However, these variables cannot take any value freely; they are limited by certain conditions arising from the problem, such as limited resources, time, money, or non-negativity requirements. These limiting conditions, written as linear inequalities or equations, are called constraints. The constraints define the feasible region (the set of all points that satisfy every restriction). A feasible solution is any point in this region, and the optimal solution is the feasible point that gives the best (maximum or minimum) value of the objective function. So the restrictions themselves are specifically called constraints.

Formula Used

Objective function: \( Z = ax + by \). Constraints (example): \( a_1x + b_1y \le c_1 \), \( a_2x + b_2y \le c_2 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the objective function. This is the linear expression we want to optimize, for example \( Z = ax + by \), where \( x \) and \( y \) are decision variables.
  2. Step 2: Understand what limits the variables. The decision variables cannot be chosen freely; they must obey conditions coming from resource limits and non-negativity, written as linear inequalities like \( a_1x + b_1y \le c_1 \) and \( x \ge 0 \), \( y \ge 0 \).
  3. Step 3: Name these restrictions. By definition, the set of linear inequalities/equations that restrict the decision variables is called the constraints of the LPP.
  4. Step 4: Rule out the other options. A feasible solution is a point satisfying all constraints, an optimal solution is the best feasible point, and an infeasible solution violates the constraints. None of these are the restrictions themselves, so option (B) constraints is correct.

Final Answer

The correct answer is (B) constraints.

Common Mistake

A common mistake is confusing constraints with feasible solutions. Constraints are the restricting conditions (the inequalities), while feasible solutions are the points that satisfy those constraints.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the objective function in an LPP. It is a linear expression of the form \( Z = ax + by \), where \( x \) and \( y \) are called decision variables. — Reason: Recognising the objective function helps us separate what we want to optimise from the conditions that limit us.
  2. Step 2: Observe that the decision variables \( x \) and \( y \) cannot take arbitrary values. They are restricted by real-world conditions such as limited resources, budget, or time. — Reason: Without these limits, the objective function could be made arbitrarily large or small, making the problem meaningless.
  3. Step 3: Express each limiting condition as a linear inequality or equation. For example, resource limits give inequalities like \( a_1x + b_1y \le c_1 \), and non-negativity requirements give \( x \ge 0 \) and \( y \ge 0 \). — Reason: Writing conditions in mathematical form allows us to work with them systematically.
  4. Step 4: Recognise that the entire collection of these limiting inequalities defines a region in the coordinate plane. Any point \( (x, y) \) that satisfies all of them is called a feasible solution, and the region of all such points is the feasible region. — Reason: The feasible region is the search space; we only look for the optimal value of \( Z \) within it.
  5. Step 5: Apply the standard definition: the set of linear inequalities or equations that restrict the values of the decision variables is specifically called constraints. — Reason: The term 'constraints' is the precise technical name given to these restrictions in the vocabulary of LPP, distinguishing them from the objective function and the decision variables.
  6. Step 6: Match the definition to the given options. The question asks for the name of the linear inequalities that act as restrictions on the variables. That name is 'constraints', which corresponds to option (B). — Reason: Direct mapping of the definition to the correct option confirms the answer.

Final Answer

The correct answer is (B) constraints.

Common Mistake

One common mistake: students confuse 'constraints' with the 'objective function'. Remember, the objective function \( Z = ax + by \) is what we optimise, while constraints are the inequalities that restrict the values of \( x \) and \( y \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: LPP optimises \( Z = ax + by \) (objective function) subject to limiting conditions on decision variables \( x \) and \( y \).
  2. Step 2: Limiting conditions written as linear inequalities, e.g. \( a_1x + b_1y \le c_1 \), \( a_2x + b_2y \le c_2 \), \( x \ge 0 \), \( y \ge 0 \), are called constraints.
  3. Step 3: Restrictions on decision variables \( \Rightarrow \) constraints (option B).

Answer: The correct answer is (B) constraints.

➕ More Examples

More Examples

Example 1

Question: In a Linear Programming Problem, a manufacturer wants to maximise profit \( Z = 5x + 8y \), where \( x \) and \( y \) are the number of units of two products. The conditions \( x + 2y \le 100 \), \( 3x + y \le 150 \), \( x \ge 0 \), \( y \ge 0 \) are imposed on the decision variables. What are these conditions called? (A) Optimal solutions (B) Feasible solutions (C) Constraints (D) Objective functions

Solution: In a Linear Programming Problem, the objective function is the function to be optimised — here it is \( Z = 5x + 8y \). The decision variables are \( x \) and \( y \). The conditions \( x + 2y \le 100 \), \( 3x + y \le 150 \), \( x \ge 0 \), and \( y \ge 0 \) are restrictions imposed on these decision variables. Such restrictions are called constraints. They limit the values that \( x \) and \( y \) can take, thereby defining the feasible region. The optimal solution is then found within this feasible region. Feasible solutions are any points satisfying all constraints, and infeasible solutions are those that violate at least one constraint. Therefore, the conditions imposed on the decision variables are called constraints.

Answer: (C) Constraints

Example 2

Question: A diet problem requires minimising cost \( Z = 3x + 7y \) subject to the conditions \( 2x + y \ge 80 \), \( x + 2y \ge 60 \), \( x \ge 0 \), \( y \ge 0 \), where \( x \) and \( y \) represent quantities of two food items. The inequalities imposed on the decision variables \( x \) and \( y \) in this LPP are known as: (A) Infeasible solutions (B) Constraints (C) Feasible solutions (D) Corner points

Solution: In any Linear Programming Problem, there are three main components: the objective function, the decision variables, and the constraints. Here, the objective function is \( Z = 3x + 7y \) (to be minimised), and the decision variables are \( x \) and \( y \). The inequalities \( 2x + y \ge 80 \), \( x + 2y \ge 60 \), \( x \ge 0 \), and \( y \ge 0 \) place restrictions on the values that \( x \) and \( y \) can take. These restrictions are called constraints. Constraints together determine the feasible region, and the optimal solution (minimum cost here) is found at one of the corner points of this feasible region. Feasible solutions are all points in the feasible region, not the restrictions themselves. Corner points are vertices of the feasible region. Therefore, the inequalities imposed on the decision variables are called constraints.

Answer: (B) Constraints

🎯 Try a Similar Question

Try a Similar Question

Question: In a Linear Programming Problem, the set of all points that satisfy all the constraints simultaneously is called: (A) Optimal Solution (B) Objective Function (C) Feasible Region (D) Infeasible Region

Solution

  1. Step 1: Recall Key Definitions: Let us review the important terms used in a Linear Programming Problem (LPP): 1. Objective Function: The linear function \ \(Z = ax + by\) \ that we want to maximise or minimise. 2. Constraints: The linear inequalities or equations that restrict the values of the decision variables. 3. Feasible Solution: Any point \((x, y)\) that satisfies all the given constraints, including non-negativity restrictions. 4. Feasible Region: The collection of ALL feasible solutions, i.e., the entire set of points satisfying every constraint simultaneously. 5. Optimal Solution: The feasible solution at which the objective function attains its maximum or minimum value. 6. Infeasible Region: The region that does NOT satisfy one or more constraints.
  2. Step 2: Analyse the Question: The question asks: which term describes the set of ALL points that satisfy ALL the constraints simultaneously? This is not a single best point (that would be an optimal solution), and it is not just one point from the satisfying region (that would be a feasible solution). The complete set of all such points forms a region — the Feasible Region.
  3. Step 3: Eliminate Incorrect Options: Option (A) — Optimal Solution: This is only ONE specific point (or edge) in the feasible region where the objective function is maximised or minimised. It is NOT the entire set of satisfying points. So (A) is incorrect. Option (B) — Objective Function: This is the function \(Z = ax + by\) to be optimised, not a set of points. So (B) is incorrect. Option (D) — Infeasible Region: This is the region where constraints are violated, which is the opposite of what is asked. So (D) is incorrect. Option (C) — Feasible Region: This correctly describes the complete set of all points satisfying all constraints simultaneously. So (C) is correct.
  4. Step 4: Confirm the Answer: By definition, the feasible region of a Linear Programming Problem is the set of all points \((x, y)\) that satisfy every constraint (including non-negativity restrictions) simultaneously. This is precisely what the question describes. Hence, the correct answer is (C).

Answer: The correct answer is (C) Feasible Region.

Everything you get with Solver7

More questions in Linear Programming