Q3.In Corner point method for solving a linear programming problem one finds the feasible region of the linear programming problem ,determines its corner points and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if
Answer : Option CExplaination / Solution:
In Corner point method for solving a linear programming problem one finds the feasible region of the linear programming problem ,determines its corner points and evaluates the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values at corner points. In case feasible region is unbounded, M is the maximum value of the objective function if the open half plane determined by ax + by > M has no point in common with the feasible region . Otherwise Z has no maximum value.
Q4.Let A = {a, b, c} then the range of the relation R = {(a, b), (a, c), (b, c)} defined on A is
Answer : Option BExplaination / Solution:
Since the range is represented by the y- co ordinate of the ordered pair ( x , y ).Therefore, range of the given relation is { b , c }.