Home › Bihar Board Class 12 (Commerce) › Mathematics › Linear Programming › Minimise Z = 3x + 9y over corner points (0,10), …
Minimise Z = 3x + 9y over corner points (0,10), (5,5), (15,15), (0,20). What is the minimum?
A90
B180
C60
D45
Answer & Solution
Correct answer: C. 60
Z is 90, 60, 180 and 180 at the four points, so the smallest value is 60 at (5, 5).
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