Linear Programming – Class 12 Maths Solutions
CBSE Class 12 Maths · NCERT solutions · 54 questions
Chapter 12 Examples Solutions →
Solve the following linear programming problem graphically: <br> $\begin{align}\text {Maximise}\ Z = 4x + y&...(1)\\ \text {subject to the constraints:}\\ x +
Chapter 12 Examples Q2Solve the following linear programming problem graphically: <br> $\begin{align}\text {Minimise}\ Z = 200x +500 y&...(1)\\ \text {subject to the constraints:}\\
Chapter 12 Examples Q3Solve the following linear programming problem graphically: <br> $\begin{align}\text {Minimise and Maximise}\ Z = 3x +9 y&...(1)\\ \text {subject to the constr
Chapter 12 Examples Q4Determine graphically the minimum value of the objective function<br>$\begin{align}\text Z=– 50x + 20y&...(1)\\ \text {subject to the constraints:}\\ 2x – y \g
Chapter 12 Examples Q5$Minimise\ Z = 3x + 2y$ $\begin{align} \text {subject to the constraints:}\\ x + y \ge 8&...(1)\\ 3x + 5y \le 15&....(2)\\ x \ge 0, y \ge 0&....(3) \end{align}
2026 Board Paper Solutions
In a linear programming problem, the linear function which has to be maximized or minimized is called <br> (A) a feasible function (B) an objective function (C
2026 Board Paper Q3For the feasible region shown below, the non-trivial constraints of the linear programming problem are (A) $x + y \le 5, x + 3y \le 9$ (B) $x + y \le 5, x +
2026 Board Paper Q14The corner points of the feasible region for an $LPP$ are $(0, 2),(6, 0), (6, 8)$ and $(0, 5).$ Let $Z = 4x + 6y$ be the objective function $(Maximum\ of\ Z)
2026 Board Paper Q14The region represented by the system of inequations $3x+y \ge3,\ 2x-y\ge -5,\ x,y\ge 0 $ is: (A)unbounded in $1^{st}$ quadrant (B)bounded in $1^{st}$ quadrant
2026 Board Paper Q15In an $LPP,$ if the objective function has the same minimum value on two corner points of the feasible region, then the number of points at which the minimum va
2026 Board Paper Q15In the graph, the feasible region representing the Linear Programming Problem for maximising objective function $Z= px + qy, p, q>0$ is shaded. If all points o
2026 Board Paper Q15The corner points of the feasible region determined by the system of linear constraints are $(0, 0), (0, 40), (20, 40) (60, 20)$ and $(60, 0).$ If the objecti
2026 Board Paper Q17The feasible region of a linear programming problem with objective function $Z = 5x + 7y$ is shown below : The maximum value of $Z –$ minimum value of $Z$ is (A
2026 Board Paper Q18The degree of an objective function of a linear programming problem is (A)$0$ (B)$1$ (C)$2$ (D)Any natural number
2026 Board Paper Q20Assertion (A) : Consider a Linear Programming Problem with minimise $Z = x + 2y$ subject to constraints $2x + y \ge 3, x + 2y \ge 6,$ $x, y \ge 0$ which gives m
2026 Board Paper Q29Solve the following Linear Programming Problem graphically : <br>$\begin{align}\text Maximize\ Z = \dfrac{2x}{5}+\dfrac{3y}{10}\\ \text{Subject to constraints }
2026 Board Paper Q29Solve the following Linear Programming Problem graphically : <br>$\begin{align}\text{Maximize Z = 200x + 120y}\\ \text{Subject to constraints }\\ x + y \le 300\
2026 Board Paper Q30Solve the following linear programming problem graphically : <br>$\begin{align}\text{Maximize Z = 13x - 15y}\\ \text{Subject to constraints }\\ x + y \le 7\\ 2x
2026 Board Paper Q31The corner points of the feasible region determined by the system of linear constraints in an $LPP$ are $(0, 10), (5, 5), (15, 15)$ and $(0, 20).$ Let $Z = px +
2026 Board Paper Q31Solve the following linear programming problem graphically : <br>$\begin{align}\text{Maximize Z = 4500x + 5000y}\\ \text{Subject to constraints }\\ x + y \le 25
2026 Board Paper Q33Solve the following Linear Programming Problem graphically : <br>$\begin{align}\text{Maximize Z = 600x + 400y}\\ \text{Subject to constraints }\\ x + 2y \le 12\
2024 Board Paper Solutions
The maximum value of $Z = 4x + y$ for an $L.P.P.$ whose feasible region is given below is: (A)$50$ (B)$110$ (C)$120$ (D)$170$
2024 Board Paper Q10A linear programming problem deals with the optimization of a/an : (A)logarithmic function (B) linear function (C) quadratic function (D) exponential function
2024 Board Paper Q10The common region determined by all the constraints of a linear programming problem is called : (A) an unbounded region (B) an optimal region (C) a bounded reg
2024 Board Paper Q10The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called : (A) feasible solutions (B) const
2024 Board Paper Q17The number of corner points of the feasible region determined by constraints $x\ge 0, y\ge0, x+y\ge4$ is: (A)$0$ (B)$1$ (C)$2$ (D)$3$
2024 Board Paper Q17Of the following, which group of constraints represents the feasible region given below ?<br>(A)$x + 2y\le 76, 2x + y\ge 104, x, y \ge 0$ (B)$x + 2y \le 76, 2x
2024 Board Paper Q19Assertion (A) : The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of $Z = x + 2y$ occurs at infinite points. Reaso
2024 Board Paper Q30Solve the following L.P.P. graphically:<br>$\begin{align}\text{Maximise Z = x + 3y}\\ \text{Subject to constraints }\\ x + 2y \le 200\\ x + y\le150\\ y\le75\\ x
2024 Board Paper Q30Solve the following linear programming problem graphically :<br>$\begin{align}\text{Maximise z= 500x + 300y}\\ \text{Subject to constraints }\\ x + 2y \le 12\\
2024 Board Paper Q30Solve the following linear programming problem graphically : <br>$\begin{align}\text{Maximise z = 4x + 3y}\\ \text{Subject to constraints }\\ x + y \le 800\\ 2x
2024 Board Paper Q37(i)The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply
2024 Board Paper Q37(ii)The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply
Exercise 12.1 Solutions →
Solve the following Linear Programming Problems graphically: $Maximise\ Z = 3x + 4y$<br> subject to the constraints : $x + y \le 4, x \ge 0, y \ge 0$.
Exercise 12.1 Q2Solve the following Linear Programming Problems graphically: $ Minimise\ Z = – 3x + 4 y$ <br>subject to $x + 2y \le 8, 3x + 2y \le 12, x \ge 0, y \ge 0.$
Exercise 12.1 Q3Solve the following Linear Programming Problems graphically: $Maximise\ Z = 5x + 3y$ <br>subject to $3x + 5y \le 15, 5x + 2y \le 10, x \ge 0, y \ge 0$.
Exercise 12.1 Q4Solve the following Linear Programming Problems graphically: $Minimise\ Z = 3x + 5y$ <br>such that $x + 3y \ge 3, x + y \ge 2, x, y \ge 0.$
Exercise 12.1 Q5Solve the following Linear Programming Problems graphically: $Maximise\ Z = 3x + 2y $ <br>subject to $x + 2y \le 10, 3x + y \le 15, x, y \ge 0.$
Exercise 12.1 Q6Solve the following Linear Programming Problems graphically: $Minimise\ Z = x + 2y$ <br>subject to $2x + y \ge 3, x + 2y \ge 6, x, y \ge 0. $
Exercise 12.1 Q7Show that the minimum of $Z$ occurs at more than two points. $Minimise\ and\ Maximise\ Z = 5x + 10 y$<br>subject to $x + 2y \le 120, x + y \ge 60, x – 2y \ge
Exercise 12.1 Q8Show that the minimum of $Z$ occurs at more than two points. $Minimise\ and\ Maximise\ Z = x + 2y$<br>subject to $x + 2y \ge 100, 2x – y \le 0, 2x + y \le 20
Exercise 12.1 Q9Show that the minimum of $Z$ occurs at more than two points. $Maximise\ Z = – x + 2y, $ subject to the constraints: $x \ge 3, x + y \ge 5, x + 2y \ge 6, y \ge 0
Exercise 12.1 Q10Show that the minimum of $Z$ occurs at more than two points.$ Maximise\ Z = x + y, $ <br>subject to $x – y \le –1, –x + y \le 0, x, y \ge 0$.
2023 Board Paper Solutions
The objective function $Z = ax + by $ of an $LPP$ has maximum value $42$ at $(4, 6)$ and minimum value $19$ at $(3, 2).$ Which of the following is true ? (A)$a
2023 Board Paper Q14The corner points of the feasible region of a linear programming problem are $(0, 4), (8, 0)$ and $\left(\dfrac{20}{3},\dfrac{4}{3}\right).$ If $Z = 30x + 24y$
2023 Board Paper Q16Which of the following points satisfies both the inequations $2x + y\le 10$ and $x + 2y\ge 8\ ?$ (A)$( -2, 4)$ (B)$(3, 2)$ (C)$( -5, 6)$ (D)$(4, 2) $
2023 Board Paper Q17The corner points of the feasible region in the graphical representation of a linear programming problem are $(2, 72), (15, 20)$ and $(40, 15).$ If $z = 18x +
2023 Board Paper Q17The number of feasible solutions of the linear programming problem given as <br>Maximize $z = 15x + 30y$ subject to constraints : <br>$3x+y\le12,\ x+2y\le 10,\
2023 Board Paper Q18The number of corner points of the feasible region determined by the constraints $x- y\ge 0, 2y \le x + 2, x\ge 0, y \ge 0$ is : (A)$2$ (B)$3$ (C)$4$
2023 Board Paper Q18The feasible region of a linear programming problem is shown in the figure below : Which of the following are the possible constraints ? <br>(A)$x + 2y \ge 4,
2023 Board Paper Q29Solve graphically the following linear programming problem : <br> \begin{aligned} \text{Maximize z = 6x + 3y,}\\ \text{subject to the constraints}\\ 4x + y \
2023 Board Paper Q29Solve the following linear programming problem graphically : <br>$ \begin{aligned} \text{Maximize : } Z=x+2y\\ \text{subject to constraints : } x+2y \ge 100,\
2023 Board Paper Q30Determine graphically the minimum value of the following objective function :<br> $\begin{aligned} z = 500x + 400y\\ \text{subject to the constraints}\\ x +
2023 Board Paper Q30Solve the following linear programming problem graphically : <br> $\begin{aligned} \text{Minimise:} z= -3x + 4y \\ \text{subject to constraints}\\ x + 2y \le