Home › Bihar Board Class 12 (Commerce) › Mathematics › Linear Programming › A cost 3x + 5y must satisfy x + 3y ≥ 3 and x + y…
A cost 3x + 5y must satisfy x + 3y ≥ 3 and x + y ≥ 2 with x, y ≥ 0. Least cost?
A10
B9
C8
D7
Answer & Solution
Correct answer: D. 7
Corner points (0,2), (3/2,1/2), (3,0) give Z = 10, 7, 9, and the region's boundary slopes confirm 7 is the minimum.
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