Feasible region's optimal solution for a linear objective function always includes

downward point

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

upward point

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

corner point

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

front point

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

Open in App

Solution

The correct option is D corner point
The vertex of the feasible solution is the corner point.
In the above figure, the blue shaded region is the feasible region and the points which highlighted in red color are the vertices of the feasible region which are called corner points.
Therefore, feasible region's optimal solution for linear objective function always includes corner point.

Suggest Corrections

Similar questions

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.

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

Q. Consider a linear programming problem with two variables and two constraints. The objective function is to maximize

x_{1} + x_{2} .

The corner points of the feasible region are (0, 0), (0, 2), (2, 0) and (4/3, 4/3)

If an additional constraint

X_{1} + X_{2} \leq 5

is added, the optimal solution is

Q. If the feasible region for an LPP is _____________, then the optimal value of the objective function z = ax + by may or may not exist.

Define optimal (feasible) solution of a linear programming problem.

Join BYJU'S Learning Program