Solving an integer programming problem by rounding off answers ob… - Vidyadip

Question

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that.

The values of decision variables obtained by rounding off are always very close to the optimal values.
The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
All constraints are satisfied exactly.
None of the above.

✓

Answer

The value of the objective function for a maximization problem will likely be less than that for the simplex solution.

Solution:

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem, we find that the value of the objective function for a maximization problem will likely be less than that for the simplex 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

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{A}=\begin{bmatrix}\alpha&\beta\\\gamma&-\alpha\end{bmatrix}$ is such that A² = I, then:

$1+\alpha^2+\beta\gamma=0$
$1-\alpha^2+\beta\gamma=0$
$1-\alpha^2-\beta\gamma=0$
$1+\alpha^2-\beta\gamma=0$

Let the solution curve $y=y(x)$ of the differential equation $\left(4+x^{2}\right) d y-2 x\left(x^{2}+3 y+4\right) d x=0$ pass through the origin. Then $y(2)$ is equal to

Let $y=y(x)$ be the solution of the differential equation $\frac{ dy }{ dx }=\frac{4 y ^{3}+2 yx ^{2}}{3 xy ^{2}+ x ^{3}}, y (1)=1$. If for some $n \in N , y (2) \in[ n -1, n )$, then $n$ is equal to $\dots\dots$

Let $\vec \alpha =(\lambda -2) \vec a + \vec b$ and $\vec \beta = (4\lambda -2)\vec a + 3\vec b$ be two given vectors where $\vec a$ and $\vec b$ are non collinear. The value of $\lambda $ for which vectors and $\vec \alpha $ and $\vec \beta $ are collinear, is

If $I _{ n }=\int_{\frac{\pi}{4}}^{\frac{\pi}{2}} \cot ^{ n } x dx ,$ then :

If the function $f$ defined as $f(x)\, = \frac{1}{x} - \frac{{k - 1}}{{{e^{2x}} - 1}}$ ,$x\, \ne \,0,$ is continuous at $x = 0.$ then the ordered pair $(k,f(0))$ is equal to?

If X follows a binomial distribution with parameter $\text{n}=100$ and $\text{p}=\frac{1}{3},$ then P(X = r) is maximum when r =

An iso-profit line represents:

If $f\, \&\, g$ are continuous functions in $[0, a]$ satisfying $f (x) = f (a - x)\, \&\, g (x) + g (a - x) = 4$ then $\int\limits_0^a {\,f\,(x)\,\,.\,\,g\,(x)dx} $ $=$

Find the minimum value of $f(x)=2 x^3-24 x+107$ in the interval $[1,3]$.