Corner points of the feasible region determined by the system of linear constraints are…
Mathematics · Class 12 · CBSE — Linear Programming
Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is
- p = 2 q
- p = 3 q
- p = q
Answer
(B)
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- The optimal value of the objective function is attained at the points
- Maximize Z = 3 x + 5 y , subject to x + 4 y ≤ 24, 3 x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0
- 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
- A manufacturer makes two products, A and B . Product A sells at ` 200 per unit and takes 30 minutes to make…
- The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 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…
- 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…
- A manufacturer produces two types of steel trunks. He has two machines A and B . The type P of the trunk…
More Linear Programming questions · Browse all practice questions