Minimize Z = 20 x 1 + 9 x 2 , subject to x 1 ≥ 0, x 2 ≥ 0, 2 x 1 + x 2 ≥ 36, 6 x 1 + x 2…
Mathematics · Class 12 · CBSE — Linear Programming
Minimize Z = 20x1 + 9x2, subject to x1 ≥ 0, x2 ≥ 0,
2x1 + x2 ≥ 36, 6x1 + x2 ≥ 60
2x1 + x2 ≥ 36, 6x1 + x2 ≥ 60
- 360 at (18, 0)
- 336 at (6, 24)
- 540 at (0, 60)
- 0 at (0, 0)
Answer
(B) 336 at (6, 24)
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- Maximize Z = 4 x + 6 y , subject to 3 x + 2 y ≤ 12, x + y ≥ 4, x , y ≥ 0
- A dealer wishes to purchase table fans and ceiling fans. He has ` 57, 600 to invest, and has space to store…
- Diet of sick person must contain atleast 4000 units of vitamins, 50 units of minerals and 2500 calories. Two…
- A shopkeeper deals in two items-thermos flasks and air tight containers. A flask costs him ` 120 and an air…
- A printing company prints two types of magazine A and B . The company earn ` 20 and ` 30 on each copy of…
- Two tailors P and Q earn ` 350 and ` 450 per day respectively. Tailor P can stitch 6 shirts and 3 trousers…
- Two different kinds of foods A and B are being considered to form a weekly diet. The minimum weekly…
- Feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4 x + 3 y occurs at the…
More Linear Programming questions · Browse all practice questions