The common region determined by all the constraints of a linear p… - Vidyadip

MCQ

The common region determined by all the constraints of a linear programming problem is called:

A
an unbounded region
B
an optimal region
C
a bounded regio
✓
a feasible region

✓

Answer

Correct option: D.

a feasible region

a 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

The number of solutions of the system of equations : $2 x+y-z=7, x-3 y+2 z=1 , x+4 y-3 z=5$

What is the solution of $\text{x}\leq4,\text{y}\geq0$ and $\text{x}\leq-4,\text{y}\geq0$?

If $\tan^{-1}3+\tan^{-1}\text{x}=\tan^{-1}8,$ then $x =$

The shortest distance between the lines $\frac{x-3}{3}=\frac{y-8}{-1}=\frac{z-3}{1}$ and $\frac{x+3}{-3}=\frac{y+7}{2}=\frac{z-6}{4}$ is

Let $\mathrm{f}: R \rightarrow R$ be function defined as

$f ( x )=\left\{\begin{array}{cc}3\left(1-\frac{| x |}{2}\right) & \text { if }| x | \leq 2 \text { } \\ 0 & \text { if }| x |>2 \text { }\end{array}\right.$ Let $g: R \rightarrow R$ be given by $g(x)=f(x+2)-f(x-2)$. If $n$ and $m$ denote the number of points in $R$ where $\mathrm{g}$ is not continuous and not differentiable, respectively, then $\mathrm{n}+\mathrm{m}$ is equal to $....$

If $y = 1 + x + {{{x^2}} \over {2!}} + {{{x^3}} \over {3!}} + .....\infty ,$ then ${{dy} \over {dx}} = $

If $x = a{\cos ^4}\theta ,y = a{\sin ^4}\theta ,$ then ${{dy} \over {dx}}$, at $\theta = {{3\pi } \over 4}$, is

Let $f(x) = (x - a)^2+ (x - b)^2 + (x - c)^2.$ Then $,f(x)$ has a minimum at $x =$

$\int_0^{\pi /2} {\frac{{\cos x - \sin x}}{{1 + \sin x\cos x}}} \,dx = $

Let $\quad \vec{a}=9 \hat{i}-13 \hat{j}+25 \hat{k}, \vec{b}=3 \hat{i}+7 \hat{j}-13 \hat{k} \quad$ and $\overrightarrow{\mathrm{c}}=17 \hat{\mathrm{i}}-2 \hat{\mathrm{j}}+\hat{\mathrm{k}}$ be three given vectros. If $\overrightarrow{\mathrm{r}}$ is a vector such that $\vec{r} \times \vec{a}=(\vec{b}+\vec{c}) \times \vec{a}$ and $\vec{r} .(\vec{b}-\vec{c})=0$, then $\frac{|593 \vec{r}+67 \vec{a}|^2}{(593)^2}$ is equal to...........