Linear programming is a method for finding the optimal values (maximum or minimum) of quantities subject to the constraints when relationship is expressed as linear equations or inequations.
Based on the above information, answer the following questions.
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 a so that the maximum of Z occurs at both the points (15,15) and (0,20) is

Options

A. p=q
B. p=2q
C. q=2p
D. q=3p