For a linear programming problem we got the following shaded region as the feasible region.

Statement : The objective function will have both maximum and minimum value on the shaded region.

True

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

False

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A True
Theorem 2 in linear programming tells that for a bounded feasible region, the maximum and minimum value of the objective function occurs on the feasible region. Feasible region in this question is bounded by four straight lines. So the maximum and minimum value occurs on the shaded region.

Suggest Corrections

Similar questions

Q. The feasible region for anLPP is shown shaded in the figure. Find the maximum value of the objective function

z = 11 x + 7 y

In following figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z =x + 2y.

Q. Define feasible region of a linear programming problem.

Q. Which of the following linear programming problems with the given constraints gives an unbounded feasible region

Let R be the feasible region (convex polygon) for a linear programming problem and let,

Z = + be the objective function. When Z has an optimal value (maximum or minimum), where the variables and are subject to constraints described by linear inequalities, this optimal value must occur at ____________of the feasible region.

Join BYJU'S Learning Program

For a linear programming problem we got the following shaded region as the feasible region. Statement : The objective function will have both maximum and minimum value on the shaded region.

For a linear programming problem we got the following shaded region as the feasible region.

Statement : The objective function will have both maximum and minimum value on the shaded region.