The value of objective function is maximum under linear constraints
(a) at the centre of feasible region
(b) at (0, 0)
(c) at any vertex of feasible region
(d) the vertex which is maximum distance from (0, 0)

Open in App

Solution

(c) at any vertex of feasible region

In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we obtain the maximum or minimum value.
Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.

Suggest Corrections

Similar questions

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. The optimal value of the objective function is attained at the points
(a) given by intersection of inequations with the axes only
(b) given by intersection of inequations with x-axis only
(c) given by corner points of the feasible region
(d) none of these

Q. The vertices of a closed-convex polygon representing the feasible region of the objective function

f = 5 x + 3 y

, are (0,0), (3,0), (3,1), (1,3) and (0,2). Find the maximum value of the objective function.

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

The value of objective function is maximum under linear constraints (a) at the centre of feasible region (b) at (0, 0) (c) at any vertex of feasible region (d) the vertex which is maximum distance from (0, 0)

The value of objective function is maximum under linear constraints
(a) at the centre of feasible region
(b) at (0, 0)
(c) at any vertex of feasible region
(d) the vertex which is maximum distance from (0, 0)