1. Class 12
  2. Solutions of Sample Papers and Past Year Papers - for Class 12 Boards
  3. CBSE Class 12 Sample Paper for 2021 Boards

Question 38 (Choice 1) - CBSE Class 12 Sample Paper for 2021 Boards

Last updated at Oct. 24, 2020 by

Solve the following linear programming problem (L.P.P) graphically. Maximize ๐‘ = ๐‘ฅ + 2๐‘ฆ subject to constraints ;
๐‘ฅ + 2๐‘ฆ ≥ 100
2๐‘ฅ − ๐‘ฆ ≤ 0
2๐‘ฅ + ๐‘ฆ ≤ 200
๐‘ฅ, ๐‘ฆ ≥ 0

 

This question is exactly same as Ex 12.1, 8 of Chapter 12 Class 12 in the NCERT Book.

Please check the answer and video here

https://www.teachoo.com/5410/758/Ex-12.1--8---Minimise-and-Maximise-Z--x---2y/category/Ex-12.1/

  1. Class 12
  2. Solutions of Sample Papers and Past Year Papers - for Class 12 Boards

    3. CBSE Class 12 Sample Paper for 2021 Boards

    CBSE Class 12 Sample Paper for 2020 Boards →
Class 12
Solutions of Sample Papers and Past Year Papers - for Class 12 Boards

About the Author

Davneet Singh's photo - Teacher, Computer Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 9 years. He provides courses for Maths and Science at Teachoo.