Question
Which of the following statement is correct?
  1. Every LPP admits an optimal solution.
  2. Every LPP admits unique optimal solution.
  3. If a LPP gives two optimal solutions it has infinite number of solutions.
  4. None of these

Answer

  1. Every LPP admits unique optimal solution.

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

Similar questions

If $\text{f(x)}=\begin{cases}\frac{\log(1+\text{ax})-\log(1-\text{bx})}{\text{x}},&\text{x}\neq0\\\text{k},&\text{x}=0\end{cases}$ and f(x) is continous at x = 0, then the value of k is:
  1. a - b
  2. a + b
  3. $\log\text{a}+\log\text{b}$
  4. none of these
If $\Delta=\left|\begin{array}{lll}5 & 3 & 8 \\ 2 & 0 & 1 \\ 1 & 2 & 3\end{array}\right|$, write the minor of the element $a_{23}$.
If $f(x) = |x^2 - 9x + 20|,$ then $f(x)$ is equal to :
The position of origin $(0,0)$ w.r.t. feasible region represented by $x+y \geq 1$ is
Given that $A=\left[\begin{array}{cc}\alpha & \beta \\ \gamma & -\alpha\end{array}\right]$ and $A^2=31$, then
The law a + b = b + a is called:
  1. Closure law.
  2. Associative law.
  3. Commutative law.
  4. Distributive law.
Let $\text{f(x)}=\begin{cases}\frac{1}{|\text{x}|} & \text{for |x|}\geq1\\\text{ax}^2+\text{b} & \text{for |x|}<1\end{cases}$ if f(x) is continuous and differentiable at any point, then:
  1. $\text{a}=\frac{1}{2},\text{b}=-\frac{3}{2}$
  2. $\text{a}=-\frac{1}{2},\text{b}=\frac{3}{2}$
  3. $\text{a}=1,\text{b}=-1$
  4. None of these.
A line makes an angle $\alpha,\beta,\gamma$ with the X, Y, Z axes. Then $\sin^2\alpha+\sin^2\beta+\sin^2\gamma=$
  1. 1
  2. 2
  3. $\dfrac{3}{2}$
  4. 4
Choose the correct answer from the given four options.
The plane 2x – 3y + 6z – 11 = 0 makes an angle $\sin^{-1}(\alpha)$ with x-axis. The value of $\alpha$ is equal to:
  1. $\frac{\sqrt{3}}{2}$
  2. $\frac{\sqrt{2}}{3}$
  3. $\frac{2}{7}$
  4. $\frac{3}{7}$
In linear programming, lack of points for a solution set is said to:
  1. Have no feasible solution
  2. Have a feasible solution
  3. Have single point method
  4. Have infinte point method