Maximize Z =11 x + 8 y , subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0

Mathematics · Class 12 · CBSE — Linear Programming

1. 44 at (4, 2)
2. 60 at (4, 2)
3. 62 at (4, 0)
4. 48 at (4, 2)

Answer

(A) 44 at (4, 2)

Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.

Related practice questions

• A company has two factories located at P and Q and has three depots situated at A , B and C . The weekly…
• A dealer wishes to purchase a number of fans and sewing machines. He has only ` 5760 to invest and has space…
• Refer to Q. 2. (Maximum value of Z + Minimum value of Z ) is equal to
• The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40)…
• Z = 4 x 1 + 5 x 2 , subject to 2 x 1 + x 2 ≥ 7, 2 x 1 + 3 x 2 ≤ 15, x 2 ≤ 3, x 1 , x 2 ≥0 The minimum value…
• The feasible region for a LPP is shown shaded in the figure. Let Z = 3 x – 4 y be the objective function…
• A shopkeeper deals in two items-thermos flasks and air tight containers. A flask costs him ` 120 and an air…
• Z =20 x 1 + 20 x 2 , subject to x 1 ≥ 0, x 2 ≥ 0, x 1 + 2 x 2 ≥ 8, 3 x 1 + 2 x 2 ≥ 15, 5 x 1 + 2 x 2 ≥ 20 The…

More Linear Programming questions · Browse all practice questions