Maximize Z = 10 x 1 + 25 x 2 , subject to 0 ≤ x 1 ≤ 3, 0 ≤ x 2 ≤ 3, x 1 + x 2 ≤ 5

Mathematics · Class 12 · CBSE — Linear Programming

1. 80 at (3, 2)
2. 75 at (0, 3)
3. 30 at (3, 0)
4. 95 at (2, 3)

Answer

(D) 95 at (2, 3)

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

Related practice questions

• Feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4 x + 3 y occurs at the…
• A company has two factories located at P and Q and has three depots situated at A , B and C . The weekly…
• The region represented by the inequalities x ≥ 6, y ≥ 2, 2 x + y ≤ 10, x ≥ 0, y ≥ 0 is
• A factory makes two types of biscuits B 1 and B 2 that cost ` 145 and ` 160 per kg respectively. The minimum…
• Two tailors P and Q earn ` 350 and ` 450 per day respectively. Tailor P can stitch 6 shirts and 3 trousers…
• Region represented by x ≥ 0 y ≥ 0 is
• 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…

More Linear Programming questions · Browse all practice questions