MCQ
The Convex Polygon Theorem states that the optimum (maximum or minimum) solution of a LPP is attained at atleastone of the ______ of the convex set over which the solution is feasible.
- AOrigin
- BCorner points
- CCentre
- DEdge
Solution:
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.
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$f(x)=(1+|\sin x|)^{\frac{3 a}{\sin x \mid}} ,\quad -\frac{\pi}{4}\,<\,x\,<\,0$
$\quad\quad\quad\quad\quad\quad b ,\quad\quad\quad\quad\quad x=0$
$\quad\quad\quad\quad e^{\cot 4 x / \cot 2 x} ,\quad\quad\quad 0\,<\,x\,<\,\frac{\pi}{4}$
If $\mathrm{f}$ is continuous at $\mathrm{x}=0$, then the value of $6 \mathrm{a}+\mathrm{b}^{2}$ is equal to: