MCQ
If the constraints in a linear programming problem are changed
  • A
    the problem is to be re-evaluated
  • B
    solution is not defined
  • C
    the objective function has to be modified
  • D
    the change in constraints is ignored

Answer

  1. the problem is to be re-evaluated

Solution:

The optimisation of the objective function of a LPP is governed by the constraints.

Therefore, if the constraints in a linear programming problem are changed, then the problem needs to be re-evaluated.

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

${(r\,.\,i)^2} + {(r\,.\,j)^2} + {(r\,.\,k)^2} = $
If system of equations $kx + 2y - z = 2,$$\left( {k - 1} \right)x + ky + z = 1,x + \left( {k - 1} \right)y + kz = 3$ has only one solution, then number of possible real value$(s)$ of $k$ is -
 
If $\vec{\text{a}}$ and $\vec{\text{b}}$ are two unit vectors inclined at an angle $\theta$, such that $\big|\vec{\text{a}}+\vec{\text{b}}\big|<1,$ then:
  1. $\theta<\frac{\pi}{3}$
  2. $\theta>\frac{2\pi}{3}$
  3. $\frac{\pi}{3}<\theta<\frac{2\pi}{3}$
  4. $\frac{2\pi}{3}<\theta<\pi$
Let $f:[0,1] \rightarrow[0,1]$ be the function defined by $f(x)=\frac{x^5}{3}-x^2+\frac{5}{9} x+\frac{17}{36}$. Consider the square region $S=[0,1] \times[0,1]$. Let $G=\{(x, y) \in S: y>f(x)\}$ be called the green region and $R=\{(x, y) \in S$ : $\mathrm{y}<\mathrm{f}(\mathrm{x})\}$ be called the red region. Let $\mathrm{L}_{\mathrm{h}}=\{(\mathrm{x}, \mathrm{h}) \in \mathrm{S}: \mathrm{x} \in[0,1]\}$ be the horizontal line drawn at a height $\mathrm{h} \in[0,1]$. Then which of the following statements is(are) ture?

($A$) There exists an $\mathrm{h} \in\left[\frac{1}{4}, \frac{2}{3}\right]$ such that the area of the green region above the line $\mathrm{L}_{\mathrm{h}}$ equals the area of the green region below the line $\mathrm{L}_{\mathrm{h}}$

($B$) There exists an $\mathrm{h} \in\left[\frac{1}{4}, \frac{2}{3}\right]$ such that the area of the red region above the line $\mathrm{L}_{\mathrm{h}}$ equals the area of the red region below the line $\mathrm{L}_h$

($C$) There exists an $\mathrm{h} \in\left[\frac{1}{4}, \frac{2}{3}\right]$ such that the area of the green region above the line $\mathrm{L}_{\mathrm{h}}$ equals the area of the red region below the line $L_h$

($D$) There exists an $\mathrm{h} \in\left[\frac{1}{4}, \frac{2}{3}\right]$ such that the area of the red region above the line $\mathrm{L}_{\mathrm{h}}$ equals the area of the green region below the line $\mathrm{L}_{\mathrm{h}}$

If a line makes angles $\alpha,\beta,\gamma,\delta$ with four diagonals of a cube, then $\cos^2\alpha+\cos^2\beta+\cos^2\gamma+\cos^2\delta$ is equal to:
If $\vec{\text{a}}+\vec{\text{b}}+\vec{\text{c}}=\vec{0},|\vec{\text{a}}|=3,\big|\vec{\text{b}}\big|=5,|\vec{\text{c}}|=7,$then the angle between $\vec{\text{a}}$ and $\vec{\text{b}}$ is:
  1. $\frac{\pi}{6}$
  2. $\frac{2\pi}{3}$
  3. $\frac{5\pi}{3}$
  4. $\frac{\pi}{3}$
The shortest distance between the line $y = x$ and the curve $y^2 = x - 2$ is
Bag $A$ contains $3$ white, $7$ red balls and bag $B$ contains $3$ white, $2$ red balls. One bag is selected at random and a ball is drawn from it. The probability of drawing the ball from the bag $\mathrm{A}$, if the ball drawn in white, is :
If vector $a = 2i - 3j + 6k$ and vector $b = - 2i + 2j - k,$ then $\frac{{{\rm{Projection\, of\, vector }} a{\rm{ on\, vector }} b}}{{{\rm{Projection \,of\, vector }} b{\rm { on\, vector }} a}} = $
Let $A=\{1,3,5\}$. Then the number of equivalence relations in $A$ containing $(1,3)$ is