SOLVER7 Study. Nothing Else.
2026 Board Paper Q2

In a linear programming problem, the linear function which has to be maximized or minimized is called
(A) a feasible function (B) an objective function (C) an optimal function (D) a constraint

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you run a small shop and want to earn as much money as possible. The amount of money you earn is the one special thing you are trying to make as big or as small as you can. In maths, this special thing has a name: the objective function. It looks like \( Z = ax + by \). Everything else — like limits on your supplies — are just rules called constraints. So the linear function you want to maximise or minimise is always called the objective function.

Answer: (B) an objective function

📖 The Objective Function in Linear Programming

Detailed Explanation

In a Linear Programming Problem (LPP), we want to find the best possible outcome (like maximum profit or minimum cost) under certain restrictions. Every LPP has two main components. The first is the function we want to make as large or as small as possible; this is called the objective function, usually written as \( Z = ax + by \), where \( a \) and \( b \) are constants and \( x, y \) are decision variables. The second component is the set of restrictions, which are called constraints and are written as linear inequalities. The set of all points satisfying the constraints forms the feasible region, and the point in this region that gives the best value of \( Z \) is the optimal solution. So the specific term for the linear function to be maximized or minimized is the objective function.

Formula Used

\( Z = ax + by \), where \( Z \) is the objective function to be maximized or minimized.

Solution

  1. Step 1: Recall the structure of a linear programming problem. It consists of an objective function together with a set of constraints and non-negativity conditions.
  2. Step 2: Identify the role of each option. A feasible function is not a standard term. An optimal function is not a standard term either. A constraint is a linear inequality that restricts the values of the variables.
  3. Step 3: The function that is to be maximized or minimized, of the form \( Z = ax + by \), is by definition called the objective function. This matches option (B).
  4. Step 4: Therefore the correct answer is the objective function, since it represents the quantity (profit, cost, etc.) that the problem seeks to optimize.

Final Answer

(B) an objective function

Common Mistake

A common mistake is confusing the objective function with a constraint. Remember: constraints are the inequalities that limit the variables, while the objective function \( Z = ax + by \) is the single expression you optimize.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Recall the two main components of a Linear Programming Problem (LPP): (i) a linear function to optimize, and (ii) a set of linear inequalities restricting the variables. — Reason: Understanding the structure of an LPP helps us correctly identify the role of each component.
  2. Step 2: Identify what constraints are. Constraints are linear inequalities (or equations) that limit the possible values of the decision variables \( x \) and \( y \). — Reason: Ruling out 'constraint' as an answer, since constraints restrict variables but are not the function being optimized.
  3. Step 3: Check the remaining options: 'feasible function' and 'optimal function' are not standard terms used in LPP theory. — Reason: Only recognized, well-defined terminology appears as the correct answer in CBSE mathematics.
  4. Step 4: Recognize that the function of the form \( Z = ax + by \) that we wish to maximize or minimize is, by definition, called the objective function. This is option (B). — Reason: The term 'objective' reflects the goal (objective) of the problem, which is to find the best possible value of \( Z \) over the feasible region.
  5. Step 5: Confirm: the set of all points satisfying every constraint forms the feasible region, and the point in that region giving the best value of \( Z = ax + by \) is the optimal solution. The function \( Z \) itself is the objective function. — Reason: This confirms that option (B) is correct and consistent with the complete definition of an LPP.

Final Answer

(B) an objective function

Common Mistake

One common mistake: Students often confuse the objective function with constraints, thinking that any equation in the LPP is the objective function — but constraints are inequalities that bound the feasible region, whereas the objective function is the specific linear expression \( Z = ax + by \) being optimized.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: In an LPP, the linear function of the form \ \( Z = ax + by \) to be maximised or minimised is defined as the objective function.
  2. Step 2: Constraints are inequalities restricting variables; feasible region is the solution set of constraints. Neither 'feasible function' nor 'optimal function' are standard LPP terms.
  3. Step 3: The function to be optimised \( \Rightarrow \) objective function \( \Rightarrow \) option (B).

Answer: (B) an objective function

➕ 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, subject to certain production constraints. The expression \( Z = 5x + 8y \) that the manufacturer wants to maximise is called: (A) a constraint (B) a feasible function (C) an objective function (D) an optimal solution

Solution: In a Linear Programming Problem, we always have a function of the decision variables that needs to be either maximised or minimised. This specific function is defined as the Objective Function. Here, the expression to be maximised is \( Z = 5x + 8y \). Let us analyse each option: Option (A) — A constraint is a linear inequality or equation that restricts the values of the decision variables (for example, \( 2x + 3y \le 120 \)). So \( Z = 5x + 8y \) is not a constraint. Option (B) — There is no standard term called a 'feasible function' in LPP. The feasible region is the set of all points satisfying the constraints, but 'feasible function' is not a recognised term. Option (C) — The Objective Function is exactly the linear function of decision variables that is to be maximised or minimised. Here, \( Z = 5x + 8y \) fits this definition perfectly. Option (D) — An optimal solution is the specific point (value of \( x \) and \( y \)) at which the objective function attains its maximum or minimum value. It is a point, not the function itself. Therefore, \( Z = 5x + 8y \) is the Objective Function.

Answer: (C) an objective function

Example 2

Question: A transport company wishes to minimise the total cost \( C = 3x + 7y \), where \( x \) and \( y \) represent the number of trips made by two types of vehicles, subject to the conditions \( x + y \ge 10 \), \( x \ge 0 \), \( y \ge 0 \). In this Linear Programming Problem, which of the following correctly identifies the role of \( C = 3x + 7y \)? (A) It is a constraint of the problem. (B) It is the objective function to be minimised. (C) It represents the feasible region. (D) It is the optimal value of the problem.

Solution: To answer this, we recall the standard structure of a Linear Programming Problem. A Linear Programming Problem consists of: 1. Decision variables — here \( x \) and \( y \). 2. Objective Function — the linear function to be maximised or minimised. 3. Constraints — linear inequalities/equations restricting the variables. 4. Feasible Region — the graphical region satisfying all constraints. 5. Optimal Value — the maximum or minimum value of the objective function over the feasible region. Now let us examine each option for \( C = 3x + 7y \): Option (A) — The constraints here are \( x + y \ge 10 \), \( x \ge 0 \), \( y \ge 0 \). The expression \( C = 3x + 7y \) is not among the constraints. So Option (A) is incorrect. Option (B) — The problem explicitly states that \( C = 3x + 7y \) is to be minimised. Since it is a linear function of the decision variables \( x \) and \( y \) that needs to be minimised, it is by definition the Objective Function. So Option (B) is correct. Option (C) — The feasible region is the set of all points \( (x, y) \) satisfying all the constraints simultaneously; it is a region in the coordinate plane, not a function. So Option (C) is incorrect. Option (D) — The optimal value is the actual minimum value of \( C \) (a number), not the function \( C = 3x + 7y \) itself. So Option (D) is incorrect. Therefore, \( C = 3x + 7y \) is the objective function to be minimised.

Answer: (B) It is the objective function to be minimised.

🎯 Try a Similar Question

Try a Similar Question

Question: In a Linear Programming Problem, the set of all feasible solutions (points) that simultaneously satisfy all the given constraints and non-negativity restrictions is called: (A) the objective function (B) an optimal solution (C) the feasible region (D) a constraint

Solution

  1. Step 1: Recall the key definitions in LPP: In a Linear Programming Problem, we deal with several important terms. Let us review each option carefully.
  2. Step 2: Analyse Option (A) — Objective Function: The objective function is the linear function \( Z = ax + by \) (where \( a, b \) are constants) that we want to maximise or minimise. It is NOT the set of feasible solutions.
  3. Step 3: Analyse Option (B) — Optimal Solution: An optimal solution is the specific point (or points) in the feasible region at which the objective function attains its maximum or minimum value. It refers to a single best solution, not the entire set of feasible points.
  4. Step 4: Analyse Option (C) — Feasible Region: The feasible region (also called the feasible set) is the collection of ALL points \( (x, y) \) that satisfy every constraint of the LPP simultaneously, including the non-negativity restrictions \( x \ge 0 \) and \( y \ge 0 \). This matches the description in the question exactly.
  5. Step 5: Analyse Option (D) — Constraint: A constraint is an individual linear inequality or equation that restricts the values of the decision variables. The set of constraints together defines the boundary of the feasible region, but a single constraint is not the same as the entire set of feasible solutions.
  6. Step 6: Conclusion: Since the question asks for the set of ALL points that simultaneously satisfy every constraint and non-negativity restriction, the correct answer is the feasible region. Hence, the correct option is (C).

Answer: (C) the feasible region

Everything you get with Solver7

More questions in Linear Programming