CBSE Class 12 Maths Linear Programming Previous Year Question Paper
This document presents a previous year question paper for CBSE Class 12 Mathematics, focusing on the topic of Linear Programming. It includes a detailed problem involving a housewife wishing to mix two food types, X and Y, to meet specific vitamin requirements at the least cost. The question requires formulating the problem as a linear programming problem and solving it graphically. It also includes a value-based question component. The provided text outlines the objective function (Minimize Z = 6x + 10y) and the constraints derived from the vitamin content and cost of the foods. It details the process of graphing the inequalities and finding the feasible region. Solving previous year question papers is crucial for students to understand the exam pattern, question types, and marking scheme, thereby improving their performance in the board examinations.
Explore more subjects
Quick info
| Board | CBSE |
|---|---|
| Class | 12 |
| Subject | Maths |
| Language | English |
| Type | Previous Year Question Paper |
| Exam type | Board Exam |
Paper pattern
The question is a 6-mark problem requiring graphical solution and formulation of a linear programming problem.
Topics covered
Paper topics
- Linear Programming
- Linear Programming Problem Formulation
- Graphical Method
- Optimization
- Cost Minimization
- Value Based Questions
Important topics
- Linear Programming Problem Formulation
- Graphical Solution of Linear Programming Problems
- Objective Function
- Constraints
- Value Based Questions
PDF preview
Read page by page below. PDF is streamed from the official NCERT website — no download button on this page.
Question paper text
Linear Programming
6 Marks Questions
- A housewife wishes to mix together two kinds of food, X and Y in such a way that the mixture contains atleast 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin contents of 1 kg of food is given below:
Vitamin A Vitamin B Vitamin C
Food X Food Y 2 2
1 kg of food X costs ₹ 6 and 1 kg of food Y costs ₹ 10. Formulate the above problem as a linear programming problem and find the least cost of the mixture which will produce the diet graphically. What value will you like to attach with this problem? Value Based Question; Delhi 2014C
Let the quantity of food X be x kg and the quantity of food Y be y kg.
... The objective function is to minimise,
<math>Z = 6x + 10y</math>.
Subject to the constraints are
<math>x + 2y \ge 10</math>
<math>2x + 2y \ge 12</math>
...(i)
...(ii)
...(iii)
...(iv)
<math>3x + y \ge 8</math>
<math>x, y \ge 0</math>
On considering the constraints as equations, we get
<math display="block">x + 2y = 10</math>
<math>x + y = 6</math>
...(v)
...(vi)
...(vii)
...(viii)
<math>3x + y = 8</math> and <math>x = 0, y = 0</math>
Firstly, draw the graph of line <math>x + 2y = 10</math> (1)
х 0 10
y 5 0 (1) On putting <math>(0, 0)</math> in the inequality <math>x + 2y \ge 10</math>, we get
<math>0 + 2(0) \ge 10 \Rightarrow 0 \ge 10</math>
[which is false]
So, the half plane is away from the origin.
Secondly, draw the graph of line <math>2x + 2y = 12</math>
X 0 6 0
Frequently asked questions
What is this document?
This is a previous year question paper for CBSE Class 12 Mathematics, specifically focusing on the topic of Linear Programming.
What is the topic covered?
The paper covers Linear Programming, including problem formulation and graphical solutions.
How does this paper help students?
Solving this previous year question paper helps students understand the exam pattern, question complexity, and marking scheme for Linear Programming topics.
What is the marking scheme for this question?
This specific question is allocated 6 marks and includes a value-based component.
How can students best use this paper?
Students should attempt to solve this paper under exam conditions to practice their problem-solving skills and time management for the board exams.
Content reviewed by the NCERT Help team. Editorial Team and update policy
Question Papers PDF on NCERT Help. URL unchanged for search indexing.