# Example 10 - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at Dec. 12, 2016 by Teachoo

Examples

Example 1

Example 2

Example 3 Important

Example 4 Important Deleted for CBSE Board 2022 Exams

Example 5

Example 6 Important Deleted for CBSE Board 2022 Exams

Example 7 Important Deleted for CBSE Board 2022 Exams

Example 8 Deleted for CBSE Board 2022 Exams

Example 9 Important Deleted for CBSE Board 2022 Exams

Example 10 Deleted for CBSE Board 2022 Exams You are here

Example 11 Important Deleted for CBSE Board 2022 Exams

Chapter 12 Class 12 Linear Programming (Term 1)

Serial order wise

Last updated at Dec. 12, 2016 by Teachoo

Hello! Teachoo has made this answer with days (even weeks!) worth of effort and love. Since your board exams are coming, why not help Teachoo create more videos and content by supporting us? Please click on this link to make a donation

Example 10 (Manufacturing problem) A manufacturer has three machines I, II and III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines. The number of hours required for producing 1 unit of each of M and N on the three machines are given in the following table: Let the number of items of type M be x, & the number of items of type N by y According to Question : Now, Profit on Type M → Rs 600 Profit on Type N → Rs 400 Hence, Z = 600x + 400 y Combining all constraints : Max Z = 600x + 400y Subject to constraints, x + 2y ≤ 12 2x + y ≤ 12 x + 1.5 y ≤ 5 x ≥ 0 , y ≥ 0