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. If M and m respectively be the largest and smallest values at corner points then ____________.

पर्याय

• If the feasible region is bounded, M and m respectively are the minimum and maximum values of the objective function

• If the feasible region is bounded, M and m respectively are the maximum and minimum values of the objective function

• If the feasible region is unbounded, M and m respectively are the maximum and minimum values of the objective function

• 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. If M and m respectively be the largest and smallest values at corner points then If the feasible region is bounded, M and m respectively are the maximum and minimum values of the objective function.

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. If Man and m are the largest and smallest values at corner locations, then M and m are the maximum and lowest values of the objective function, respectively, if the feasible region is bounded.