A Linear Programming Problem is as follows: \text{ Minimise } z=2 x+y \text{ subject to the constraints } x \geq 3, x \leq 9, y \geq 0 x-y \geq 0, x+y \leq 14 The feasible region has

Correct Answer is : 5 corner points including (14,0) and (9,0)

5 corner points including (0,0) and (9,5)

5 corner points including (14,0) and (9,0)

5 corner points including (3,6) and (9,5)

CBSE Class 12 Math 2022 Term I Solved Paper - Question 11

Question : 11 of 50

Marks: +1, -0

A Linear Programming Problem is as follows:

\;\text " Minimise "\;\;z=2 x+y

\;\text " subject to the constraints "\;\;x ≥ 3, x ≤ 9, y ≥ 0

\;x-y ≥ 0, x+y ≤ 14

The feasible region has

Solution:

Explanation: On plotting the constraints

x=3

x=9, x=y

and

x+y=14

, we get the following graph. From the graph given below it clear that feasible region is

{\ABCDEA}

, including corner points

{\A}(9,0), {\B}(3,0), {\C}(3,3), {\D}(7,7)

and

{\E}(9,5)

.
Thus feasible region has 5 corner points including

(7,7)

and

(3,3)

Go to Question:

Prev Question

Next Question