Test Index

CBSE Class 12 Math 2022 Term I Solved Paper

© examsnet.com
Question : 11 of 50
Marks: +1, -0
A Linear Programming Problem is as follows:
 Minimise   z=2x+y\text{ Minimise }\;z=2x+y
 subject to the constraints   x3,  x9,  y0\text{ subject to the constraints }\;x\ge 3,\;x\le 9,\;y\ge 0
  xy0,  x+y14\;x-y\ge 0,\;x+y\le 14
The feasible region has
Explanation: On plotting the constraints x=3x=3, x=9,  x=yx=9,\;x=y and x+y=14x+y=14, we get the following graph. From the graph given below it clear that feasible region is ABCDEA\text{ABCDEA}, including corner points A(9,0),  B(3,0),  C(3,3),  D(7,7)A(9,0),\;B(3,0),\;C(3,3),\;D(7,7) and E(9,5)E(9,5).
Thus feasible region has 5 corner points including (7,7)(7,7) and (3,3)(3,3).
© examsnet.com
Go to Question: