Simplex method of solving linear programming problem uses

only the corner points of the feasible region

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

all the points in the feasible region

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

intermediate points within the infeasible region

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

only the interior points in the feasible region

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

Open in App

Solution

The correct option is A only the corner points of the feasible region
Linear programming solved by the simplex method uses only the corner points of the feasible region because at one of these points, the value of the objective function is either maximum or minimum.

Suggest Corrections

Similar questions

3 x + 5 y \leq 5; 5 x + 2 y \leq 10; x \geq 0, y \geq 0

Z = 5 x + 3 y

Z = 5 x + y

3 x + 5 y \geq 5

5 x + 2 y \leq 10

x \geq 0, y \geq 0

Z = 60 x + 30 y

2 x + 3 y \geq 120

2 x + y \geq 80

x \geq 0, y \geq 0

Join BYJU'S Learning Program