Download App

Linear Programming — Maths STD 12 Science — Question

Gujarat BoardEnglish MediumSTD 12 ScienceMathsLinear Programming1 Mark
Question
The optimal value of the objective function is attained at the points
  1. given by intersection of inequations with the axes only
  2. given by intersection of inequations with x-axis only
  3. given by corner points of the feasible region
  4. none of these
✓

Answer

  1. given by corner points of the feasible region

Solution:

It is known that the optimal value of the objective function is attained at any of the corner point.

Thus, the potimal value of the objective function is attined at the points given by corner points 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→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

Similar questions

If $y = {\sin ^2}\alpha + {\cos ^2}(\alpha + \beta ) + 2\sin \alpha \sin \beta \cos (\alpha + \beta )$, then ${{{d^3}y} \over {d{\alpha ^3}}}$ is, (keeping $\beta $ as constant)
→
Given that A is a square matrix of order 3 and |A| = -4, then |adj A| is equal to:
  1. -4
  2. 4
  3. -16
  4. 16
→
$\frac{{{d^3}y}}{{d{x^3}}} + 2\,\left[ {1 + \frac{{{d^2}y}}{{d{x^2}}}} \right] = 1$ has degree and order as
→
A $2\, m$ ladder leans against a vertical wall. If the top of the ladder begins to slide down the wall at the rate $25\, cm/ sec$., then the rate (in $cm/sec$.) at which the bottom of the ladder slides away from the wall on the horizontal ground when the top of the ladder is $1\, m$ above the ground is
→
$\int_{}^{} {{{\cos }^5}x\;dx = } $
→
If f : R → R and g : R → R defined by f(x) = 2x + 3 and g(x) = x2 + 7, then the value of x for which f(g(x)) = 25 is:
  1. $\pm1$
  2. $\pm2$
  3. $\pm3$
  4. $\pm4$
→
Two players, $P_1$ and $P_2$, play a game against each other. In every round of the game, each player rolls a fair die once, where the six faces of the die have six distinct numbers. Let $x$ and $y$ denote the readings on the die rolled by $P_1$ and $P_2$, respectively. If $x>y$, then $P_1$ scores $5$ points and $P_2$ scores $0$ point. If $x=y$, then each player scores $2$ points. If $x$

List-$I$ List-$II$
($I$) Probability of $\left(X_2 \geq Y_2\right)$ is ($P$) $\frac{3}{8}$
($II$) Probability of $\left(X_2>Y_2\right)$ is ($Q$) $\frac{11}{16}$
($III$) Probability of $\left(X_3=Y_3\right)$ is ($R$) $\frac{5}{16}$
($IV$) Probability of $\left(X_3>Y_3\right)$ is ($S$) $\frac{355}{864}$
  ($T$) $\frac{77}{432}$

 

The correct option is:

→
$f(x) = \left\{ \begin{array}{l}
2 - \left| {{x^2} + 5x + 6} \right|,\,\,\,x \ne  - 2\\
{a^2} + 1,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,x =  - 2
\end{array} \right.$ . Then the range of $a$ , so that $f(x)$ has maximum at $x = -2$, is
→
If the points $(2,-3),(k,-1)$ and $(0,4)$ are collinear, then find the value of $4 k$.
→
If $x = {\sin ^{ - 1}}(3t - 4{t^3})$ and $y = {\cos ^{ - 1}}\,\,\sqrt {(1 - {t^2})} $, then ${{dy} \over {dx}}$ is equal to
→