Let Z = ax + by be the objective function at each corner point. Let m and n, respectively denote the largest and smallest values of these points. When the feasible region is ………, m and n are the maximum and minimum values of Z.

Unshaded

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

Unbounded

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

Shaded

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

Bounded

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

Open in App

Solution

The correct option is D
Bounded

Let Z = ax + by be the objective function at each corner point. Let m and n, respectively denote the largest and smallest values of these points. When the feasible region is bounded, m and n are the maximum and minimum values of Z.

Suggest Corrections

Similar questions

Q. Corner points of the bounded feasible region for an LP problem are

A (0, 5) B (0, 3) C (1, 0) D (6, 0)

. Let

z = - 50 x + 20 y

be the objective function. Minimum value of z occurs at ______ center point.

Q. The corner points of the feasible region for an LPP are

(0, 2),

(3, 0),

(6, 0),

(6, 8)

and

(0, 5) .

Let

Z = 4 x + 6 y

be the objective function. Then minimum value of

Z

occurs at

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 corner points of the feasible region are