Home
Class 12
MATHS
A company manufactures and sells two mod...

A company manufactures and sells two models of lamps `L_1` and `L_2`, the profit being ₹ 15 and ₹ 10 respectively. The process involves two workers `W_1` and `W_2` who are available for this kind of work 100 hours and 80 hours per month respectively, `W_1` assembles,`L_1` in 20 and L_2 in 30 minutes.W_2 [aomts L_1 in 20 and L-2 in 10 minutes. Assuming that all lamps made can be sold, formulate the LPP for determining the productions figures for maximum proft.

Promotional Banner

Topper's Solved these Questions

  • LINEAR INEQUALITIES

    MBD PUBLICATION|Exercise QUESTION BANK|46 Videos
  • MATHEMATICAL REASONING

    MBD PUBLICATION|Exercise QUESTION BANK|108 Videos

Similar Questions

Explore conceptually related problems

Two wires made from the same material have their lengths L and 2L and the radii 2r and r respectively. What is the ratio of their elongation if they are stretched by the same force ?

MBD PUBLICATION-LINEAR PROGRAMMING-QUESTION BANK
  1. A merchant sells two models X and Y of TV with cost price ₹ 25000 and ...

    Text Solution

    |

  2. A company manufactures and sells two models of lamps L1 and L2, the p...

    Text Solution

    |

  3. A factory uses three different respurce for the manufacture of two dif...

    Text Solution

    |

  4. A man plans to start a poultry farm by investing at most ₹ 3000. He ca...

    Text Solution

    |

  5. (Allocation Problem.)A farmer has 5 acres of land on which he wishes t...

    Text Solution

    |

  6. Special purpose coins each weighing 10gms are to be manufactured using...

    Text Solution

    |

  7. A company produces three types of cloth A,B and C. Three kinds of wool...

    Text Solution

    |

  8. MaximizeZ =5x1+6x2 "Subject to" : 2x1 +3x2 le 6 x1,x2 ge 0

    Text Solution

    |

  9. Minimize:Z=6x1+7x2 "Subject to":x1+2x2 ge 4 x1,x2 ge 0

    Text Solution

    |

  10. Maximize :Z=20x1+40x2 "Subject to" :x1+x2 le 1 x1,x2 ge 0.

    Text Solution

    |

  11. Solve the following LPP graphically. Minimize z=30x1+45x2 subject to 2...

    Text Solution

    |

  12. Optimize :Z=5x1+25x2 "Subject to":-0.5x1+x2 le 2 -x1+5x2 ge 5 x1,x2 g...

    Text Solution

    |

  13. Maximize:Z=14x1+4x2 "Subject to":x1+12x2 le 65 7x1 -2x2 le 25 2x1+3x2 ...

    Text Solution

    |

  14. Maximize:Z=10x1+12x2+8x3 "Subject to": x1+2x2 le 30 5x1 -7x3 ge 12 x1+...

    Text Solution

    |

  15. Minimize:Z=20x1+10x2 "Subject to": x1+2x2 le 40 3x1 -x2 ge 30 4x1+3x2 ...

    Text Solution

    |

  16. MaximizeZ =4x1+3x2 "Subject to" : x1 +x2 le 50 x1+2x2 le 80 2x1+x2 ge ...

    Text Solution

    |

  17. Maximize :Z=20x1+40x2 "Subject to" :x1+x2 le 1 x1,x2 ge 0.

    Text Solution

    |

  18. Minimize:Z=6x1+7x2 "Subject to":x1+2x2 ge 4 x1,x2 ge 0

    Text Solution

    |

  19. Maximize :Z =1500x +2000y "Subject to" :x+y lt 20 x+2y lt 24 x,y ge ...

    Text Solution

    |

  20. Maximize :Z= 15x +10y "Subject to" : 2x +3y le 600 2x+y le 480 x,y ge ...

    Text Solution

    |