The corner points of the feasible region determined by the system of linear constraints…
Mathematics · Class 12 · CBSE — Linear Programming
The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5),
(15, 15), (0, 20). Let Z = px + qy, where p, q > 0 Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is
(15, 15), (0, 20). Let Z = px + qy, where p, q > 0 Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is
- p = q
- p = 2 q
- q = 2 p
- q = 3 p
Answer
(D) q = 3 p
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- Diet of sick person must contain atleast 4000 units of vitamins, 50 units of minerals and 2500 calories. Two…
- Two tailors P and Q earn ` 350 and ` 450 per day respectively. Tailor P can stitch 6 shirts and 3 trousers…
- A manufacturer produces two types of steel trunks. He has two machines A and B . The type P of the trunk…
- A man has ` 1500 for purchase of rice and wheat. A bag of rice and a bag of wheat cost ` 180 and ` 120…
- The feasible region for an LPP is shown shaded in the figure. Let F = 3 x – 4 y be the objective function…
- A shopkeeper sells two items, colour T.V. sets and DVD players. He can invest ` 12,00,000 and can store only…
- An aeroplane can carry a maximum of 250 passengers. A profit of ` 1500 is made on each executive class ticket…
- The objective function Z = 4 x + 3 y can be minimum subjected to the constraints 3 x + 4 y ≤ 24, 8 x + 6 y ≤…
More Linear Programming questions · Browse all practice questions