Recent questions tagged optimization

Match the LIST-I with LIST-II$\begin{array}{|l|l|l|l|} \hline & \textbf{LIST-I} && \textbf{LIST-II} \\ & \textbf{Name of Methods} && \textbf{Problem Type} \\ \hline \te...

A linear programming problem $\text{(LPP)}$ is as follows:Min $z=30 x-18 y,$ subject to the constraints; $3 x+4 y \leq 60, 5 x-3 y \geq 20$ and $x, y \geq 0.$ In this fea...

Find the largest value of $x y$ subject to $x^{2}+y^{2}=2$.

What is the maximum area of the rectangle with perimeter $620$ mm ?$24,025 \mathrm{~mm}^{2}$$22,725 \mathrm{~mm}^{2}$$24,000 \mathrm{~mm}^{2}$$24,075 \mathrm{~mm}^{2}$

The maximum value of the function $f(x)=\frac{x}{2}-\frac{1}{1+x^{2}}$ on the set $\{x \in \mathbb{R}: x(x-1) \leq 12\}$ is$0$$33 / 17$$-8 / 5$$-1$ 

Consider the primal problem :Maximize $z=5 x_{1}+12 x_{2}+4 x_{3}$Subject to \[\begin{array}{l}x_{1}+2 x_{2}+x_{3}=10\\2 x_{1}-x_{2}+3 x_{3}=8 \\x_{1}, x_{2}, x_{3} \geq ...

Consider the following Linear programming problem $\text{(LPP)}$:Maximize $z=x_1+x_2$Subject to the constraints:$x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \...

Consider the following statements with respect to duality in $\text{LPP}$:The final simplex table giving optimal solution of the primal also contains optimal solution of ...

With respect to a loop in the transportation table, which one of following is not correct?Every loop has an odd no.of cells and atleast $5$.Closed loops may or may not be...

At which of the following stage(s), the degeneracy do not occur in transportation problem?($m,n$ represents number of sources and destinations respectively)While the valu...

The solution that satisfies all constraints of the given problem and either maximizes or minimizes a given objective function is called ________ solution.greedyfeasibleop...

Consider the following LPP:Min $Z=2x_1+x_2+3x_3$Subject to:$x_1 – 2x_2+x_3 \geq 4$$2x_1+x_2+x_3 \leq 8$$x_1-x_3 \geq 0$$x_1, x_2, x_3 \geq 0$The solution of this LPP usin...

Consider the following LPP:Max $Z=15x_1+10 x_2$Subject to the constraints$4x_1 +6x_2 \leq 360$$3x_1+0x_2 \leq 180$$0x_1+5x_2 \leq 200$$x_1, x_2 \geq 0$The solution of the...

Which of the following is a valid reason for causing degeneracy in a transportation problem? Here $m$ is number of rows and $n$ is number of columns in transportation tab...

Consider the following statements:Revised simplex method requires lesser computations than the simplex methodsRevised simplex method automatically generates the inverse o...

The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem existsconcavityconvexityqu...