Download App

Linear Programming — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSLinear Programming1 Mark
Question
In Graphical solution the redundant constraint is:
✓

Answer

  1. Which does not form boundary of feasible region.
Solution:
A constraint in an LP model becomes redundant when the feasible region doesnt change by the removing the constraint.
For example, $2\text{x}+\text{y}\geq10$ and $6\text{x}+3\text{y}\geq30$ are constraints.
$6\text{x}+3\text{y}\geq30$
$\Rightarrow3\times(2\text{x}+\text{y})\geq3\times10$
$\Rightarrow2\text{x}+\text{y}\geq10$
 which is same as the first constraint.
Therefore, $6\text{x}+3\text{y}\geq30$  can be removed.
By removing this constraint the feasible region doesnt change.
If the boundary of the feasible region is removed then feasible solution set changes.
Hence, redundant constraint cannot be the boundary of the feasible region.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q (1 Marks)" from Linear Programming→Linear Programming — all question types→MATHS STD 12 Science question papers→Rajasthan Board STD 12 Science question papers→Rajasthan Board question paper generator→

Similar questions

For the given half-cylinder of volume $V$, the total surface area $S$ is minimum, when
→
Let g(x) = 1 + x - [x] and $\text{f(x)}=\begin{cases}-1,&\text{x}<0\\0,&\text{x}=0\\1,&\text{x}>0\end{cases}$ where [x] denotes the greatest integer less than or equal to x. Then for all x, f(g(x)) is equal to:
  1. x
  2. 1
  3. f(x)
  4. g(x)
→
Corner points of the feasible region of inequalities gives
→
If $\text{P}(\text{A}\cup\text{B})=0.8$ and $\text{P}(\text{A}\cap\text{B})=0.3$ then $\text{P}(\overline{\text{A}})=\text{P}(\overline{\text{B}})=$
→
If a line makes 45°, 60° with positive direction of axes x and y then the angles it makes with the z-axis is:
→
The area of the region bounded by the curve $y=\sin x$ between the ordinates $x=0, x=\frac{\pi}{2}$ and the $x$-axis is
→
Choose the most correct of the following statements relating to primal - dual linear programming problems:
  1. Shadow prices of resources in the primal are optimal values of the dual variables.
  2. The optimal values of the objective functions of primal and dual are the same.
  3. If the primal problem has unbounded solution, the dual problem would have infeasibility.
  4. All of the above.
→
Let $3\sin(\text{xy})+4\cos(\text{xy})=5,$ then $\frac{\text{dy}}{\text{dx}}=$
  1. $-\frac{\text{y}}{\text{x}}$
  2. $\frac{3\sin(\text{xy})+4\cos(\text{xy})}{3\cos(\text{xy})-4\sin(\text{xy})}$
  3. $\frac{3\cos(\text{xy})+4\sin(\text{xy})}{4\cos(\text{xy})-3\sin(\text{xy})}$
  4. $\text{None of these.}$
→
The maximum value of Z = 3x + 4y subjected to constraints $\text{x}+\text{y}\leq4,\text{x}\geq0$ and $\text{y}\geq0$ is:
→
If $|\vec{a}|=3,|\vec{b}|=4$, then the value of $\lambda$ for which $\vec{a}+\lambda \vec{b}$ is perpendicular to $\vec{a}-\lambda \vec{b}$, is
→