CBSE 2025 Competency-Based Questions: The Central Board of Secondary Education (CBSE) has officially released the practice question paper for the academic year 2024-25, for the class 12th on its official website. Competency-focused questions can be helpful for students to secure good marks while referring and practicing them. It will help students to get familiar with the style and format of questions which are expected to appear in the final examinations.
In this article you will find specifically for Class 12 Maths Chapter 12 Linear Programming downloadable PDF link. At the end of this article, a free PDF link has been attached for the students to access and download.
CBSE Class 12 Maths Chapter 12 Competency-Based Questions
The chapter 12 CBQs for Class 12 Maths are given below. The questions provided here are MCQs whose complete PDF is attached at the end of these questions along with Volume 2 with free response questions.
Q: 5 State whether the following statement is true or false. Justify your answer. A linear programming problem can have infinitely many optimal solutions.
Q: 6 A packaging company has the capacity to produce rectangular boxes and circular boxes. Each rectangular box takes 2 minutes to make and it sells for a profit of Rs 4. Each circular box takes 3 minutes to make and it sells for a profit of Rs 5.
Their client requests for 25 boxes to be ready in one hour. The packaging company wants to maximize their profit from this order.
Frame this optimization problem as a linear programming problem.
Q: 7 State whether the following statement is true or false. Justify your answer. A linear programming problem whose feasible region is unbounded does not have an optimal solution.
Q: 8 The objective function of a linear programming problem is given by Z = ax + by; where a and b are constants. If the minimum of Z occurs at two points, (50, 30) and (20, 40), find the relationship between a and b. Show your work.
Q: 9 Sameer framed the following linear programming problem to minimise the monthly operational cost in running his bakery.
Minimise Z = 200 x + 300 y
subject to the constraints:
2x + 3y = 1200
1.5 y + 2 x z 900
x + y ≤ 400
x, y ≥ 0
where x is the number of orders for bread loaves and y is the number of orders for cakes. Graph the feasible region for Sameer's LPP and find the optimal solution.
↓
↓
↓
To download this complete set of questions with the solutions and get more diverse options, click on the links below:
| CBSE Class 12 Maths Chapter 12 Linear Programming Competency Focused Questions 2024-25 With Answers Volume 1 | |
| CBSE Class 12 Maths Chapter 12 Linear Programming Competency Focused Questions 2024-25 With Answers Volume 2 |
-1755192668192.jpg)
-(1).jpg)
Comments
All Comments (0)
Join the conversation