![Example 10 - Chapter 12 Class 12 Linear Programming - Part 2](https://d1avenlh0i1xmr.cloudfront.net/2cf70f6a-5546-4b57-81df-67369fd98cf9/slide23.png)
![Example 10 - Chapter 12 Class 12 Linear Programming - Part 3](https://d1avenlh0i1xmr.cloudfront.net/b1eddd4d-b122-44a7-8b4e-adb4854c1349/slide24.png)
![Example 10 - Chapter 12 Class 12 Linear Programming - Part 4](https://d1avenlh0i1xmr.cloudfront.net/133398a0-e493-40d1-8b6b-6f3ac727d88d/slide25.png)
![Example 10 - Chapter 12 Class 12 Linear Programming - Part 5](https://d1avenlh0i1xmr.cloudfront.net/c5a28302-2c22-4af8-9bde-792570661c0e/slide26.png)
Examples
Last updated at April 16, 2024 by Teachoo
Question 5 (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