Home › Bihar Board Class 12 (Commerce) › Mathematics › Linear Programming › What is always true about the shape of the feasi…
What is always true about the shape of the feasible region of a linear programming problem?
AIt is a circle
BIt is a triangle
CIt is a rectangle
DIt is a convex region
Answer & Solution
Correct answer: D. It is a convex region
An intersection of half planes is always convex, though it need not be a triangle or rectangle.
Related questions
The word linear in L.P.P. means the variables in every function have index at most what?For the constraints 2x + y ≤ 8, x + 2y ≤ 8, x ≥ 0, y ≥ 0, which point is a feasible solutiThe feasible region of an L.P.P. has vertices (0,0), (4,0), (2,3) and (0,4). What is the mIn the corner point method, what follows finding the vertices?Which two methods are named for solving an L.P.P., of which only one is studied here?By the convex polygon theorem, the optimum of z occurs where?What type of set is the set of all feasible solutions of an L.P.P.?A feasible solution that gives the maximum or minimum value of z as required is called wha