Download App

Linear Programming — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSLinear Programming1 Mark
Question
Unboundedness is usually a sign that the LP problem.
✓

Answer

  1. Has been formulated improperly.
Solution:
A linear programming problem is said to have unbounded solution if it has infinite number of solutions.
I.e., the problem has been formulated improperly.

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 every point P(x, y, z) on the x-axis (except the origin),
  1. x = 0, y = 0, z ≠ 0
  2. y = 0, z = 0, y ≠ 0
  3. y = 0, z = 0, x ≠ 0
  4. x = y = z = 0
→
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then, R is:
  1. Reflexive and symmetric.
  2. Transitive and symmetric.
  3. Equivalence.
  4. Reflexive, transitive but not symmetric.
→
The most economical speed to run the train is
→
The derivative of $e^{x^3}$ with respect to $\log x$ is
→
If $\text{P(A)}=\frac{2}{5},\text{P(B)}=\frac{3}{10}$ and $\text{P}(\text{A}\cap\text{B})=\frac{1}{5},$ then, $\text{P}(\overline{\text{A}}|\overline{\text{B}}) \text{ P}(\overline{\text{B}}|\overline{\text{A}})$ is equal to
  1. $\frac{5}{6}$
  2. $\frac{5}{7}$
  3. $\frac{25}{42}$
  4. $1$
→
If $A=\left[\begin{array}{ccc}1 & -1 & 0 \\ 2 & 3 & 4 \\ 0 & 1 & 2\end{array}\right]$ and $B=\left[\begin{array}{ccc}2 & 2 & -4 \\ -4 & 2 & -4 \\ 2 & -1 & 5\end{array}\right]$, then
→
The range of the function ${f(x)}=^{7-{x}}\text{P}_{{x}-3}$ is:
→
The optimal value of the objective function is attained at the points.
  1. Given by intersection of inequation with y - axis only.
  2. Given by intersection of inequation with x - axis only.
  3. Given by corner points of the feasible region.
  4. None of these
→
An objective function in a linear program can be which of the following?
  1. A maximization function
  2. A nonlinear maximization function
  3. A quadratic maximization function
  4. An uncertain quantity
  5. A divisible additive function
→
In which of the following function is onto :
→