Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and…

Mathematics · Class 12 · CBSE — Linear Programming

1. (0, 2) only
2. (3, 0) only
3. the mid-point of the line segment joining the points (0, 2) and (3, 0) only
4. any point on the line segment joining the points (0, 2) and (3, 0)

Answer

(D) any point on the line segment joining the points (0, 2) and (3, 0)

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

Related practice questions

• Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and…
• Maximize Z = 10 x 1 + 25 x 2 , subject to 0 ≤ x 1 ≤ 3, 0 ≤ x 2 ≤ 3, x 1 + x 2 ≤ 5
• Z = 6 x + 21 y , subject to x + 2 y ≥ 3, x + 4 y ≥ 4, 3 x + y ≥ 3, x ≥ 0, y ≥ 0 The minimum value of Z occurs…
• Feasible region for an LPP is shown shaded in the following figure. Minimum of Z = 4 x + 3 y occurs at the…
• Maximize Z = 4 x + 6 y , subject to 3 x + 2 y ≤ 12, x + y ≥ 4, x , y ≥ 0
• The feasible region for a LPP is shown shaded in the figure. Let Z = 3 x – 4 y be the objective function…
• Shamali wants to invest ` 50,000 in saving certificates and PPF. She wants to invest atleast ` 15, 000 in…
• A dealer wishes to purchase a number of fans and sewing machines. He has only ` 5760 to invest and has space…

More Linear Programming questions · Browse all practice questions