Linear Programming Exercise 12.1 Solutions
CBSE Class 12 Maths · NCERT solutions · 10 questions
Step-by-step NCERT solutions for every question in Linear Programming Exercise 12.1 of CBSE Class 12 Maths. Tap any question to see the full worked solution and the exam-ready answer.
Solve the following Linear Programming Problems graphically: $Maximise\ Z = 3x + 4y$<br> subject to the constraints : $x + y \le 4, x \ge 0, y \ge 0$.
Exercise 12.1 Q2Solve the following Linear Programming Problems graphically: $ Minimise\ Z = – 3x + 4 y$ <br>subject to $x + 2y \le 8, 3x + 2y \le 12, x \ge 0, y \ge 0.$
Exercise 12.1 Q3Solve the following Linear Programming Problems graphically: $Maximise\ Z = 5x + 3y$ <br>subject to $3x + 5y \le 15, 5x + 2y \le 10, x \ge 0, y \ge 0$.
Exercise 12.1 Q4Solve the following Linear Programming Problems graphically: $Minimise\ Z = 3x + 5y$ <br>such that $x + 3y \ge 3, x + y \ge 2, x, y \ge 0.$
Exercise 12.1 Q5Solve the following Linear Programming Problems graphically: $Maximise\ Z = 3x + 2y $ <br>subject to $x + 2y \le 10, 3x + y \le 15, x, y \ge 0.$
Exercise 12.1 Q6Solve the following Linear Programming Problems graphically: $Minimise\ Z = x + 2y$ <br>subject to $2x + y \ge 3, x + 2y \ge 6, x, y \ge 0. $
Exercise 12.1 Q7Show that the minimum of $Z$ occurs at more than two points. $Minimise\ and\ Maximise\ Z = 5x + 10 y$<br>subject to $x + 2y \le 120, x + y \ge 60, x – 2y \ge
Exercise 12.1 Q8Show that the minimum of $Z$ occurs at more than two points. $Minimise\ and\ Maximise\ Z = x + 2y$<br>subject to $x + 2y \ge 100, 2x – y \le 0, 2x + y \le 20
Exercise 12.1 Q9Show that the minimum of $Z$ occurs at more than two points. $Maximise\ Z = – x + 2y, $ subject to the constraints: $x \ge 3, x + y \ge 5, x + 2y \ge 6, y \ge 0
Exercise 12.1 Q10Show that the minimum of $Z$ occurs at more than two points.$ Maximise\ Z = x + y, $ <br>subject to $x – y \le –1, –x + y \le 0, x, y \ge 0$.
← All exercises in Linear Programming