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

The solution of the differention equation $\frac{\text{dy}}{\text{dx}}=\frac{\text{x}^{2}+\text{xy}+\text{y}^{2}}{\text{x}^{2}}$ is:

$\tan^{-1}\big(\frac{\text{x}}{\text{y}}\big)-\log\text{y}+\text{C}$
$\tan^{-1}\big(\frac{\text{y}}{\text{x}}\big)-\log\text{x}+\text{C}$
$\tan^{-1}\big(\frac{\text{x}}{\text{y}}\big)=\log\text{x}+\text{C}$
$\tan^{-1}\big(\frac{\text{y}}{\text{x}}\big)=\log\text{y}+\text{C}$

The function $f(x)=[x]$, where $[x]$ denotes the greatest integer less than or equal to $x$, is continuous at

For which of the following element in the determinant $\triangle=\begin{bmatrix}5&-5&8\\6&2&-1\\5&-6&8\end{bmatrix},$ the minor and the cofactor both are zero.

-5
2
-6
8

If $y = 2 sin x + sin 2 x$ for $0 \le x \le 2 \pi ,$ then the area enclosed by the curve and the $x-$ axis is

In a regular triangular prism the distance from the centre of one base to one of the vertices of the other base is $l.$ The altitude of the prism for which the volume is greatest

Let $P = \left[ {{a_{ij}}} \right]$ be $4 \times 4$ matrix. If $\left| P \right| = - 2$ , then value of $\left| {\,\,adj\,\left( {3P} \right)} \right|$ ,is (where $|A|$ denotes determinant value of matrix $A$ )

If $A = \left[ {\begin{array}{*{20}{c}}1&2&{ - 1}\\3&0&{\,\,2}\\4&5&{\,\,0}\end{array}} \right]$, $B = \left[ {\begin{array}{*{20}{c}}1&0&0\\2&1&0\\0&1&3\end{array}} \right],$then $AB$ is

If A and B are such that $\text{P}(\text{A}\cup\text{B})=\frac{5}{9}$ and $\text{P}(\overline{\text{A}}\cup\overline{\text{B}})=\frac{2}{3},$ then $\text{P}(\overline{\text{A}})+\text{P}(\overline{\text{B}})=$

$\frac{9}{10}$
$\frac{10}{9}$
$\frac{8}{9}$
$\frac{9}{8}$

The area bounded by the curve y = x⁴ - 2x³ + x² + 3 with x-axis and ordinates corresponding to the minima of y is:

$1$
$\frac{91}{30}$
$\frac{30}{9}$
$4$

Which of the following is a property of all linear programming problems?