Download App

Linear Programming — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSLinear Programming1 Mark
Question
If two constraints do not intersect in the positive quadrant of the graph, then.
✓

Answer

  1. The problem is infeasible
Solution:
Any linear programming problem must have the following properties:-1.
The relationship between variables and constraints must be linear2.
The constraints must be non - negative.3.. objective function must be linear.
Non - negativity conditions are used because the variables cannot take negative values.
i.e., it is not possible to have negative resources (land, capital, labour cannot be negative).
Because of the non - negativity condition, the feasible region exists only in I quadrant.

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

If two events are independent, then
→
 The solution of the differential equation $\frac{\text{dy}}{\text{dx}}=\frac{\text{ax}+\text{g}}{\text{by}+\text{f}}$ represents a circle when,
→
If the points $A (-1,3,2), B (-4,2,-2)$ and $C (5,5, \lambda)$ are collinear then the value of $\lambda$ is
→
Choose the correct answer from the given four options.
The vector in the direction of the vector $\hat{\text{i}}-2\hat{\text{j}}+2\hat{\text{k}}$ that has magnitude 9 is:
  1. $\hat{\text{i}}-2\hat{\text{j}}+2\hat{\text{k}}$
  2. $\frac{\hat{\text{i}}-2\hat{\text{j}}+2\hat{\text{k}}}{3}$
  3. $3(\hat{\text{i}}-2\hat{\text{j}}+2\hat{\text{k}})$
  4. $9(\hat{\text{i}}-2\hat{\text{j}}+2\hat{\text{k}})$
→
The objective function of LPP defined over the convex set attains its optimum value at.
  1. Atleast two of the corner points.
  2. All the corner points.
  3. Atleast one of the corner points.
  4. None of the corner points.
→
Which of the following triplets give the direction cosines of a line$:$
→
A parallelopiped is formed by planes drawn through the point (2, 3, 5) and (5, 9, 7) parallel to the coordinate planes. The length of a diagonal of the parallelopiped is:
  1. $7$
  2. $\sqrt{38}$
  3. $\sqrt{155}$
  4. $\text{none of these}$
→
If  (0, 0),(a, 0)  and  (0, b)  are collinear, then:
  1. ab = 0
  2. a = b
  3. a = −b
  4. a - b = c
→
To write the dual; it should be ensured that
  1.  All the primal variables are non - negative.
  2. All the bi values are non - negative.
  3. All the constraints are $\leq$ type if it is maximization problem and $\geq$ type if it is a minimization problem.
  1. I and II
  2. II and III
  3. I and III
  4. I, II and IIl
→
The values of the constants a, b and for which the function $\text{f(x)}=\begin{cases}(1+\text{ax})^{\frac{1}{\text{x}}},&\text{x}>0\\\text{b},&\text{x}=0\\\frac{(\text{x}+\text{c})^{\frac{1}{2}}-1}{(\text{x}+1)^{\frac{1}{2}}-1},&\text{x}>0\end{cases}$ may be continuous at x = 0, are:
  1. $\text{a}=\log_{\text{e}}\Big(\frac{2}{3}\Big),\text{ b}=-\frac{2}{3},\text{ c}=1$
  2. $\text{a}=\log_{\text{e}}\Big(\frac{2}{3}\Big),\text{ b}=\frac{2}{3},\text{ c}=-1$
  3. $\text{a}=\log_{\text{e}}\Big(\frac{2}{3}\Big),\text{ b}=\Big(\frac{2}{3}\Big),\text{ c}=1$
  4. none of these
→