The Convex Polygon Theorem states that the optimum (maximum or mi… - Vidyadip

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.

A
Origin
B
Corner points
C
Centre
D
Edge

✓

Answer

Corner points

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.

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

If $a \ne 0,\,\,b \ne 0$ and $|a + b|\, = \,|a - b|,$ then the vectors $a$ and $b$ are

If A is any square matrix, then which of the following is skew-symmetric?

A + A^T
A - A^T
AA^T
A^TA

If $\text{y}=\log\Big(\frac{1-\text{x}^2}{1+\text{x}^2}\Big),$ then $\frac{\text{dy}}{\text{dx}}=$

$\frac{4\text{x}^3}{1-\text{x}^4}$
$-\frac{4\text{x}}{1-\text{x}^4}$
$\frac{1}{4-\text{x}^4}$
$-\frac{4\text{x}^3}{1-\text{x}^4}$

Point (4, 0) lies on:

$\vec{\text{XO}}$
$\vec{\text{YO}}$
$\vec{\text{OX}}$
$\vec{\text{OY}}$

Let $y = f (x)$ and $y = g (x)$ be two differentiable function in $[0,2]$ such that $f(0) = 3,$ $f(2) = 5$ , $g (0) = 1$ and $g(2) = 2$. If there exist atlellst one $c \in \left( {0,2} \right)$ such that $f'(c)=kg'(c)$,then $k$ must be

The integral $\int \frac{1}{\sqrt[4]{(x-1)^{3}(x+2)^{5}}} d x$ is equal to :

(where $\mathrm{C}$ is a constant of integration)

Find the principal value of $\cos ^{-1}\left(-\frac{1}{2}\right)$

The solution of the differential equation $3{e^x}\tan ydx + (1 - {e^x}){\sec ^2}ydy = 0$ is

The corner points of the feasible region determined by the following system of linear inequalities: $2\text{x}+\text{y}\leq10,\text{x}+3\text{y}\leq15, \text{x},\text{y}\geq0$ are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Conditions on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is:

The area bounded by the curve $\text{y}=\cos\text{x}$ in one are of the curve is where $=4\text{n}+1,\text{x}\in \text{integer:}$

$2\text{a}$
$\frac{1}{\text{a}} $
$\frac{2}{\text{a}}$
$2{\text{a}^2}$