Download App

Linear Programming — Maths STD 12 Science — Question

Gujarat BoardEnglish MediumSTD 12 ScienceMathsLinear Programming1 Mark
MCQ
The feasible solution of an LP problem, is ________.
  • A
    Must satisfies all of the problems constraints simultaneously.
  • B
    Must be a corner point of the feasible region.
  • C
    Need not satisfy all of the constraints, only some of them.
  • D
    Must optimize the value of the objective function.
✓

Answer

  1. Must satisfies all of the problems constraints simultaneously.

Solution:

The feasibe solution of a inear programming probem (LP) is a solution that must satisfy all of the problems constraints simultaniously.

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 $\text{x}=2\text{ at},\text{y}=\text{at}^2,$ where a is a constant, then $\frac{\text{d}^2\text{y}}{\text{dx}^2}\text{ at}\ \text{x}=\frac{1}{2}$ is:
  1. $\frac{1}{2}\text{a}$
  2. 1
  3. 2a
  4. None of these
→
Area between the curve $\text{y}=\cos^2\text{x},$  x-axis and ordinates x = 0 and x = p in the interval (0, p) is:
  1. $2\pi3$
  2. $2\pi$
  3. $\pi$
  4. $\frac{\pi}{2}$
→
Given $ABC$ is an equilateral triangle of side length $1$ unit and $P$ be any arbitrary point on the circumcircle of triangle $ABC,$ then $|\vec PA|^2+|\vec PB|^2+|\vec PC|^2$ is equal to 
→
If $a_n$ is the greatest term in the sequence $a _{ n }=\frac{ n ^3}{ n ^4+147}, n =1,2,3 \ldots \ldots$. , then $\alpha$ is equal to $..........$.
→
The shortest distance between the lines $\frac{\text{x}-3}{3}=\frac{\text{y}-8}{-1}=\frac{\text{z}-3}{1}$ and, $\frac{\text{x}+3}{-3}=\frac{\text{y}+7}{2}=\frac{\text{z}-6}{4}$ is:
→
If $ a$  and $ b$ are unit vectors and $a - b$ is also a unit vector, then the angle between $ a $ and $ b$ is
→
The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let z = px + qy where p, q > 0. Condition on p and q so that the maximum of z occurs at both the points (15, 15) and (0, 20) is __________.
  1. q = 2p
  2. p = 2p
  3. p = q
  4. q = 3p
→
Let $\vec{a}=2 \hat i-\hat{\mathrm{j}}+2 \hat{\mathrm{k}}$ and $\overrightarrow{\mathrm{b}}=\hat{\mathrm{i}}+2 \hat{\mathrm{j}}-\hat{\mathrm{k}}$. Let a vector $\overrightarrow{\mathrm{v}}$ be in the plane containing $\overrightarrow{\mathrm{a}}$ and $\overrightarrow{\mathrm{b}}$. If $\overrightarrow{\mathrm{v}}$ is perpendicular to the vector $3 \hat{\mathrm{i}}+2 \hat{\mathrm{j}}-\hat{\mathrm{k}}$ and its projection on $\vec{a}$ is $19\, units,$ then $|2 \vec{v}|^{2}$ is equal to .... .
→
If $\tan \mathrm{A}=\frac{1}{\sqrt{x\left(x^2+x+1\right)}}, \tan B=\frac{\sqrt{x}}{\sqrt{x^2+x+1}}$ and $\tan C=\left(x^{-3}+x^{-2}+x^{-1}\right)^{\frac{1}{2}}, 0 < A, B, C < \frac{\pi}{2}$ then $A+B$ is equal to :
→
The optimal value of the objective function is attained at the points
→