Question
The optimal value of the objective function is attained at the points
  1. given by intersection of inequations with the axes only
  2. given by intersection of inequations with x-axis only
  3. given by corner points of the feasible region
  4. none of these

Answer

  1. given by corner points of the feasible region
Solution:
It is known that the optimal value of the objective function is attained at any of the corner point.
Thus, the potimal value of the objective function is attined at the points given by corner points of the feasible region.

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

Similar questions

If $\vec{\text{a}}$ and $\vec{\text{b}}$ be two unit vectors and $\theta$ the angle between them, than $\vec{\text{a}}+\vec{\text{b}}$ is a unit vector if $\theta=$
  1. $\frac{\pi}{4}$
  2. $\frac{\pi}{3}$
  3. $\frac{\pi}{2}$
  4. $\frac{2\pi}{3}$
A set of values of decision variables that satisfies the linear constraints and non - negativity conditions of an L.P.P. is called its:
Choose the correct answers from the given four options:
If f(x) = 2x and $\text{g(x)}=\frac{\text{x}^2}{2}+1,$ then which of the following can be a discontinuous function:
  1. $\text{f(x)}+\text{g(x)}$
  2. $\text{f(x)}-\text{g(x)}$
  3. $\text{f(x)}\cdot\text{g(x)}$
  4. $\frac{\text{g(x)}}{\text{f(x)}}$
The equation of the plane parallel to the lines x - 1 = 2y - 5 = 2z and 3x = 4y - 11 = 3z -4 and passing through the point (2, 3, 3) is:
  1. x - 4y + 2z + 4 = 0
  2. x + 4y + 2z + 4 = 0
  3. x - 4y + 2z - 4 = 0
  4. None of these
If P(A) + P(B) = 1; then which of the following option explains the event A and B correctly?
  1. Event A and B are mutually exclusive, exhaustive and complementary events.
  2. Event A and B are mutually exclusive and exhaustive events.
  3. Event A and B are mutually exclusive and complementary events.
  4. Event A and B are exhaustive and complementary events.
If $A=\left[\begin{array}{lll}1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1\end{array}\right]$, then $A$ is :
Let $R$ be the relation on the set of all real numbers defined by $a R b$ iff $|a-b| \leq 1$. Then, $R$ is
The value of objective function is maximum under linear constraints
  1. at the centre of feasible region
  2. at (0, 0)
  3. at any vertex of feasible region
  4. the vertex which is maximum distance from (0, 0)
Consider the objective function Z = 40x + 50y The minimum number of constraints that are required to maximize Z are:
 If the points $(\text{k} + 1, 1), (2\text{k} + 1, 3)$ and $(2\text{k} + 2, 2\text{k})$ are collinear, then the value of $\text{k}$is:
  1. $2$
  2. $-2$
  3. $\frac{1}{2}$
  4. $1$