MCQ
The Convex Polygon Theorem states that the optimum $($maximum or minimum$)$ solution of a $\text{LPP}$ is attained at atleastone of the $........$ of the convex set over which the solution is feasible.
- AOrigin
- ✓Corner points
- CCentre
- DEdge
✓
Answer
Correct option: B.
Corner points
The fundamental theorem of programming $($i.e., Convex Polygon Theorem$)$ states that the optimum value$($maximum or minimum$)$ of a linear programming problem over a convex region occur at the corner points.
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
Explore more
Similar questions
Let $\alpha $ and $\beta $ be the roots of the equation $x^2 + x + 1 = 0.$ Then for $y \ne 0$ in $R,$ $\left| {\begin{array}{*{20}{c}}
{y\, + \,1}&\alpha &\beta \\
\alpha &{y\, + \,\beta }&1\\
\beta &1&{y\, + \,\alpha }
\end{array}} \right|$ is equal to
→{y\, + \,1}&\alpha &\beta \\
\alpha &{y\, + \,\beta }&1\\
\beta &1&{y\, + \,\alpha }
\end{array}} \right|$ is equal to
If $4a + 2b + c = 0$, then the equation $3 a x^2+2 b x+c=0$ has atleast one real root lying in the interval :
→If $A = \left[ {\begin{array}{*{20}{c}}1&0\\2&0\end{array}} \right],B = \left[ {\begin{array}{*{20}{c}}0&0\\1&{12}\end{array}} \right]$, then
→The magnitude of the vector $6 \hat{i}-2 \hat{j}+3 \hat{k}$ is
→The feasible region for a LPP is shown shaded in the figure. Let Z = 3x - 4y be the objective function. Minimum of Z occurs at.
A function $f: R \rightarrow R$ defined as $f(x)=x^2-4 x+5$ is:
→Let $a,\,b$ and $c$ be three vectors. Then scalar triple product $[a\,b\,c]$ is equal to
→If $\displaystyle \text{a}_{\text{ij}}=0\left (\text{i}\neq \text{j} \right )$ and $\displaystyle \text{a}_{\text{ij}}=1\left (\text{i}= \text{j} \right )$ then the matrix $\text{A}=\displaystyle \left [\text{a}_{\text{ij}} \right ]_{\text{n}\times\text{n}}$ is a $ ....... $ matrix :
→The degree of the differntial equation $\Big(\frac{\text{d}^{2}\text{y}}{\text{dx}^{2}}\Big)^{2}=\Big(\frac{\text{dy}}{\text{dx}}\Big)=\text{y}^{3}$ is:
→If matrix $A = \left[ {\begin{array}{*{20}{c}}3&2&4\\1&2&{ - 1}\\0&1&1\end{array}} \right]$and ${A^{ - 1}} = \frac{1}{K}adj(A),$ then $K$is
→