Which one of the following represents the correct feasible region determined by the following constraints of an LPP?

Which of the following sets is not convex?

The number of Basic variables in any solution of Transportation problem with m-origins and n-destinations is

In a LLP degeneracy arises at

For the objective function z = px + qy, where p, q > 0 the corner points of the feasible region determined by the system of linear constraints are - (0, 10), (5, 5), (15, 15) and (0, 20), condition on p and q so that maximum of z occurs at both the points (15, 15) and (0, 20) is: