Question

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 the feasible region is unbounded, m is the minimum value of the objective function.

Options

• if the open half-plane determined by ax + by < m has points in common with the feasible region

• if the open half-plane determined by ax + by < m has no point in common with the feasible region

• if the open half-plane determined by ax + by < m has no point in common with the feasible region

• None of these

Answer 1

if the open half-plane determined by ax + by < m has no point in common with the feasible region