Question

In the graph, the feasible region representing the Linear Programming Problem for maximising objective function Z = px + qy, p, q > 0 is shaded. If all points on segment AB give max (Z), then which of the following is true ?

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40) (60, 20) and (60, 0). If the objective function of an LPP is Z = 4x + 3y, then the maximum value is :

The corner points of the feasible region for an LPP are (0, 2), (6, 0), (6, 8) and (0, 5). Let Z = 4x + 6y be the objective function. (Maximum of Z) – (Minimum of Z) is equal to :

The corner points of the feasible region determined by the system of linear constraints in an LPP are (0, 10), (5, 5), (15, 15) and (0, 20). Let Z = px + qy, p, q > 0, be the objective function, then find the relation between p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20).