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

MCQ

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

A
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.
C
The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
D
All constraints are satisfied exactly.

✓

Answer

Correct option: B.

The value of the objective function for a maximization problem will likely be less than that for the simplex 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

Let $\text{y}=\sqrt{\sin\text{x}+\text{y}},$ then $\frac{\text{dy}}{\text{dx}}=$

Evaluate $\begin{bmatrix}3&-1&3\\6&-5&4\\3&-2&3\end{bmatrix}$ is:

If $A = \{a, b, c\},$ then the relation $R = \{b, c\}$ on $A$ is:

If $\text{f}(\text{x})=\text{e}^{\text{x}}\sin\text{x}$ in $[0,\pi],$ then c in Rolle's theorem is:

The corner points of the bounded feasible region are $(0,0),(2,0),(4,2),(2,4)$ and $\left(0, \frac{10}{3}\right)$

Then for the objective function $z=-x+2 y$

$(i)$ Maximum value of $z$ has at $\ldots \ldots \ldots . . .$

$(ii)$ Minimum value of $z$ has at $\ldots \ldots \ldots . . .$

$(iii)$ The maximum value of $z$ is $\ldots \ldots \ldots . . .$

$(iv)$ The minimum value of $z$ is $\ldots \ldots \ldots . . .$

A value of $x$ satisfying the equation $\sin \left[ {{{\cot }^{ - 1}}\left( {1 + x} \right)} \right] = \cos \left[ {{{\tan }^{ - 1}}\,x} \right]$ , is

$\int {\frac{{1 + x + \sqrt {x + {x^2}} }}{{\sqrt x \, + \sqrt {1 + x} }}\,\,dx = } $

For the function $\text{f}(\text{x})=\text{x}+\frac{1}{\text{x}}$

Corner points of the feasible region determined by the system of linear constraints are $(0,3), (1,1)$ and $(3,0) .$ Let $Z=p x+q y,$ where $p, q\,>\,0 .$ Condition on $p$ and $q,$ so that the maximum of $Z$ occurs at $(3,0)$ and $(1,1)$ is $.....$

The curve, with the property that the projection of the ordinate on the normal is constant and has a length equal to $'a',$ is