Home › MHT-CET › Mathematics › Linear Programming › The feasible region of an L.P.P. has vertices (0…
The feasible region of an L.P.P. has vertices (0,0), (4,0), (2,3) and (0,4). What is the maximum of z = 5x + 3y?
A19
B12
C20
D23
Answer & Solution
Correct answer: C. 20
The values of z at the vertices are 0, 20, 19 and 12, so the maximum is 20 at (4,0).
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 solutiIn 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 whaThe common region determined by all constraints of an L.P.P. is called which region?