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 feasible region is unbounded, M is the maximum value of the objective function if ____________.

पर्याय

• The open half-plane determined by ax + by > M has points in common with the feasible region

• The open half-plane determined by ax + by > M has no point in common with the feasible region

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

• None of these

Answer 1

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 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.

Explanation:

Finding the feasible region of a linear programming problem, determining its corner points, and evaluating the objective function Z = ax + by at each corner point are all part of the corner point approach for solving a linear programming issue. Let M and m be the largest and smallest values at corner locations, respectively. If the feasible region is unbounded, M is the objective function's highest value if the open half-plane specified by ax + by > M has no point in common with it. Otherwise, Z has no upper limit.