Home › CBSE Class 12 (Commerce) › Mathematics › Linear Programming › On an unbounded region, when is the corner value…
On an unbounded region, when is the corner value m the minimum of Z?
AIf ax + by < m has no region point
BIf ax + by > m has no region point
CIf m is a positive number
DIf region touches the y-axis
Answer & Solution
Correct answer: A. If ax + by < m has no region point
For an unbounded region, m is the minimum only if the open half plane ax + by < m shares no point with the region.
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