If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:
- Athe required optimal solution is at the midpoint of the line joining two points.
- Bthe optimal solution occurs at every point on the line joining these two points.
- Cthe $LPP$ under consideration is not solvable.
- Dthe $LPP$ under consideration must be reconstructed.
Explore More
Similar Questions
The corner points of the feasible region are $(0,10), (5,5), (15,15), (0,20)$. The maximum value of $Z = 3x + 9y$ is . . . . . . .
Minimize $Z = 13x - 15y$ subject to the constraints: $x + y \leq 7$,$2x - 3y + 6 \geq 0$,$x \geq 0$,$y \geq 0$.
Medium
View SolutionWhich of the following statements is correct?
Easy
View SolutionThe objective function of a Linear Programming Problem $(LPP)$ is
Easy
View SolutionThe coordinates of the corner points of the bounded feasible region are $(0,10), (5,5), (15,15)$,and $(0,20)$. The maximum value of the objective function $Z = 10x + 20y$ is:
Vedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo