NCERT Solutions For Class 12 Maths Chapter 12 Linear Programming Exercise 12.1 Question 1 to 10 Answer: Downlaod pdf

Solve the following Linear Programming Problems graphically:

ncert class 12 maths chapter 12 Linear Programming

Question 1:Maximise Z = 3x + 4y subject to the constraints : x + y 4, x 0, y 0.

exercise 12.1 maths class 12 Chapter 12 Linear Programming

Question 2:Minimise Z = – 3x + 4 y subject to x + 2y 8, 3x + 2y 12, x 0, y 0.

cbse class 12 maths ncert solutions Chapter 12

Question 3:Maximise Z = 5x + 3y subject to 3x + 5y 15, 5x + 2y 10, x 0, y 0.

Class 12 maths solutions Linear Programming

Question 4:Minimise Z = 3x + 5y such that x + 3y 3, x + y 2, x, y 0.

ncert class 12 chemistry chapter 12 exercise solutions

Question 5:Maximise Z = 3x + 2y subject to x + 2y 10, 3x + y 15, x, y 0.

Linear Programming Class 12 ncert solutions

Question 6:Minimise Z = x + 2y subject to 2x + y 3, x + 2y 6, x, y 0. Show that the minimum of Z occurs at more than two points.

Question 7:Minimise and Maximise Z = 5x + 10 y subject to x + 2y 120, x + y 60, x – 2y 0, x, y 0.

Exercise 12.1 class 12 Math ncert solutions Chapter 12

Question 8:Minimise and Maximise Z = x + 2y subject to x + 2y 100, 2x – y 0, 2x + y 200; x, y 0.

Solve the following Linear Programming Problems gr

Question 9:Maximise Z = – x + 2y, subject to the constraints: x 3, x + y 5, x + 2y 6, y 0.

Question 10:Maximise Z = x + y, subject to x – y –1, –x + y 0, x, y 0.

Ncert Solution for class 6 to 12 download in pdf

Follow Us On

Facebook

Twitter

Youtube

Linkdin