Home › MHT-CET › Mathematics › Linear Programming › In the corner point method, what follows finding…
In the corner point method, what follows finding the vertices?
AShade the other side
BFind z at each vertex
CDraw a unit circle
DDifferentiate z now
Answer & Solution
Correct answer: B. Find z at each vertex
The objective function is evaluated at each vertex and the best value is chosen.
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 mWhich 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 whaThe common region determined by all constraints of an L.P.P. is called which region?