A furniture manufacturer produces tables and bookshelves made up of wood and steel. The…
Mathematics · Class 12 · CBSE — Linear Programming
A furniture manufacturer produces tables and bookshelves made up of wood and steel. The weekly requirement of wood and steel is given as below.
The weekly availability of wood and steel is 450 and 100 units respectively. Profit on a table is ` 1000 and that on a bookshelf is ` 1200 To determine the number of tables and bookshelves to be produced every week in order to maximize the total profit, formulate the problem as LPP.
The weekly availability of wood and steel is 450 and 100 units respectively. Profit on a table is ` 1000 and that on a bookshelf is ` 1200 To determine the number of tables and bookshelves to be produced every week in order to maximize the total profit, formulate the problem as LPP.
- Maximize Z = 1000x + 1200y
Subject to8x + 11y ≥ 450, 2x + 3y ≤ 100, x ≥ 0, y ≥ 0 - Maximize Z = 1000x + 1200y
Subject to8x + 11y ≤ 450, 2x +3y ≤ 100, x ≥ 0, y ≥ 0 - Maximize Z = 1000x + 1200y
Subject to8x + 11y ≤ 450, 2x + 3y ≥ 100, x ≥ 0, y ≥ 0 - Maximize Z = 1000x + 1200y
Subject to8x + 11y ≥ 450, 2x + 3y ≥ 100, x ≥ 0, y ≥ 0
Answer
(B) Maximize Z = 1000 x + 1200 y Subject to8 x + 11 y ≤ 450, 2 x +3 y ≤ 100, x ≥ 0, y ≥ 0
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- A manufacturer makes two products, A and B . Product A sells at ` 200 per unit and takes 30 minutes to make…
- A dealer wishes to purchase table fans and ceiling fans. He has ` 57, 600 to invest, and has space to store…
- A dealer wishes to purchase a number of fans and sewing machines. He has only ` 5760 to invest and has space…
- The feasible region for a LPP is shown shaded in the figure. Let Z = 3 x – 4 y be the objective function…
- An oil company requires 13,000, 20,000 and 15,000 barrels of high grade, medium grade and low grade oil…
- A manufacturer produces two types of steel trunks. He has two machines A and B . The type P of the trunk…
- The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40)…
- Z = 8 x + 10 y , subject to 2 x + y ≥ 7, 2 x + 3 y ≥15, y ≥ 2, x ≥ 0, y ≥ 0 The minimum value of Z occurs at
More Linear Programming questions · Browse all practice questions