If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:

  • A
    the required optimal solution is at the midpoint of the line joining two points.
  • B
    the optimal solution occurs at every point on the line joining these two points.
  • C
    the $LPP$ under consideration is not solvable.
  • D
    the $LPP$ under consideration must be reconstructed.

Explore More

Similar Questions

$A$ feasible solution to an $LP$ problem . . . . . . .

The following graph represents a feasible region. The minimum value of $z = 5x + 4y$ is $\ldots \ldots$

If $x+y \leq 2, x \geq 0, y \geq 0$,the point at which the maximum value of $3x+2y$ is attained will be:

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

The feasible region for an $LPP$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The minimum value of $Z$ is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo