The objective function of LPP defined over the convex set attains… - Vidyadip

MCQ

The objective function of LPP defined over the convex set attains its optimum value at.

A
Atleast two of the corner points.
B
All the corner points.
✓
Atleast one of the corner points.
D
None of the corner points.

✓

Answer

Correct option: C.

Atleast one of the corner points.

Let Z = ax + by be the objective function
When Z has optimum value(maximum or minimum), where the variables
x and y are subject to constraints described by linear inequalities, this optimum value must occur at a corner points of the feasible region.
Thus, the function attains its optimum value at one of 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

A particle acted on by constant forces $4i + j - 3k$ and $3i + j - k$ is displaced from the point $i + 2j + 3k$ to the point $5i + 4j + k$. The total work done by the force is ............... $\mathrm{unit}$

For binary operation $\times$ defind on $R – \{1\}$ such that $\text{a}\times\text{b}=\frac{\text{a}}{\text{b}+1}$ is:

If matrix $A=\left[\begin{array}{cc}x+y & 3 \\ 4 & y\end{array}\right]=\left[\begin{array}{ll}4 & 3 \\ 4 & 1\end{array}\right]$ then the value of $x$ will be :

if x lies in the interval $[0, 1]$, then the least value of $x^2 + x + 1$ is :

Let G be the centroid of $\triangle{\text{ABC}}$. if $\overrightarrow{\text{AB}}=\vec{\text{a}},\overrightarrow{\text{AC}}=\vec{\text{b}}$, then the bisector $\overrightarrow{\text{AG}}$, in terms of $\vec{\text{a}}$ and $\vec{\text{b}}$ is,

The vectors $3\,i + j - 5\,k$ and $a\,i + b\,j - 15\,k$ are collinear, if

Let $f(x) = (x + |x|) |x|.$ Then, for all $x:$

Inverse of the function $y = 2x - 3$ is

In an LPP, if the objective function $Z=a x+b y$ has the same maximum value on two corner points of the feasible region, then the number of points at which $Z_{\max }$ occurs is

The distance of the line $\vec{\text{r}}=2\hat{\text{i}}-2\hat{\text{j}}+3\hat{\text{k}}+\lambda(\hat{\text{i}}-\hat{\text{j}}+4\hat{\text{k}})$ from the plane $\vec{\text{r}}.(\hat{\text{i}}+5\hat{\text{j}}+\hat{\text{k}})=5$ is: