Question
Mathematics Question on Linear Programming Problem and its Mathematical Formulation
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
A
p=2q
B
p=2q
C
p=3q
D
p=q
Answer
p=2q
Explanation
Solution
Given corner points are (0,3),(1,1),(3,0)
z=px+qy
At (3,0),z=3p
At (1,1),z=p+q
It is given that the minimum of z occurs at (3,0) and (1,1)
⇒3p=p+q
⇒2p=q
⇒p=q/2