List of top Mathematics Questions on Linear Programming Problem asked in KCET

In Linear Programming Problem (LPP), the objective function $Z = ax + by$ has the same maximum value at two corner points. The number of points at which $Z_{max}$ occurs is

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$. The relation between $p$ and $q$, so that the maximum $z$ occurs at both points (15, 15) and (0, 20) is