The value of objective function is maximum under linear constraints
- at the centre of feasible region
- at (0, 0)
- at any vertex of feasible region
- the vertex which is maximum distance from (0, 0)
The value of objective function is maximum under linear constraints
Solution:
In linear programming problem we substitute the coordinates of vertices of feasible region in the objective function and then we obtain the maximum or minimum value.
Therefore, the value of objective function is maximum under linear constraints at any vertex of feasible region.
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$(i)$ $f (x)$ is bounded on $a \le x \le b.$
$(ii)$ The equation $f (x) = 0$ has at least one solution in $a < x < b.$
$(iii)$ The maximum and minimum values of $f (x)$ on $a \le x \le b$ occur at points where $f ' (c) = 0$.
$(iv)$ There is at least one point $c$ with $a < c < b$ where $f ' (c) > 0$.
$(v)$ There is at least one point $d$ with $a < d < b$ where $f ' (c) < 0.$