$A$ feasible solution to an $LP$ problem . . . . . . .
- Amust satisfy all of the problem's constraints simultaneously
- Bneed not satisfy all of the constraints,only some of them.
- Cmust be a corner point of the feasible region
- Dmust optimize the value of the objective function.
Explore More
Similar Questions
Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Medium
View SolutionThe feasible region for an $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The maximum value of $z$ is $....$
Medium
View SolutionIn a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region determined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:
DifficultMHT CET 2026
View SolutionThe corner points of the feasible region determined by $A (20, 10)$,$B (18, 12)$,and $C (12, 12)$. The maximum value of the objective function $Z = 2x + 3y$ is . . . . . . .
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:
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