The linear programming problem:
Maximize Z=x+y,
subject to the constraints x-y≤-1, x+y≤0, x, y≥0 has

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: