Class CBSE Class 12 Mathematics Linear Programming Q #1736
KNOWLEDGE BASED
APPLY
1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE
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
Prev Next
Correct Answer: B

AI Tutor Explanation

Powered by Gemini

Detailed Solution

Step 1: Define Linear Programming Components

A Linear Programming Problem (LPP) consists of three main components: the objective function, the constraints, and the non-negativity restrictions.

Step 2: Identify the Objective Function

The linear function $Z = ax + by$, which is to be maximized or minimized subject to certain constraints, is formally defined in the CBSE Class 12 curriculum as the objective function.

Step 3: Evaluate the Options

Option (A) 'feasible function' is not a standard term in LPP. Option (C) 'optimal function' is incorrect as 'optimal' refers to the solution, not the function itself. Option (D) 'constraint' refers to the linear inequalities that restrict the variables.

Final Answer: Option (B)

AI generated content. Review strictly for academic accuracy.

Pedagogical Audit
Bloom's Analysis: This is an APPLY question because it requires the student to recall and correctly apply the standard terminology used in the Linear Programming chapter of the CBSE syllabus.
Knowledge Dimension: CONCEPTUAL
Justification: The question tests the student's understanding of the fundamental definitions and nomenclature of LPP models.
Syllabus Audit: In the context of CBSE Class 12, this is classified as KNOWLEDGE (Textbook). This question directly assesses the foundational definitions provided in the NCERT textbook for the Linear Programming unit.

More from this Chapter

MCQ_SINGLE
If the feasible region of a linear programming problem with objective function \(Z = ax + by\), is bounded, then which of the following is correct?
SA
Solve the following linear programming problem graphically : Minimize $Z = 13x – 15y$ Subject to constraints $x + y \le 7$, $2x – 3y + 6 \le 0$, $x \ge 0, y \ge 0$
MCQ_SINGLE
For a Linear Programming Problem (LPP), the given objective function \(Z=3x+2y\) is subject to constraints: \(x+2y\le10\), \(3x+y\le15\), \(x, y\ge0\). The correct feasible region is:
LA
Solve the following L.P.P. graphically: Maximise $Z=60x+40y$ Subject to $x+2y\le12$, $2x+y\le12$, $4x+5y\ge20$, $x,y\ge0$
MCQ_SINGLE
The corner points of the feasible region in graphical representation of a L.P.P. are \((2, 72)\), \((15, 20)\) and \((40, 15)\). If \(Z = 18x + 9y\) be the objective function, then
View All Questions