The optimal value of the objective function is attained at the points
- Agiven by intersection of lines representing inequations with axes only
- Bgiven by intersection of lines representing inequations with $X$-axis only
- Cgiven by corner points of the feasible region
- Dat the origin
Explore More
Similar Questions
Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Medium
View SolutionThe linear programming problem $(LPP)$ to maximize $z = 2x + 5y$ subject to the constraints $x + 3y \leq 6$, $2x + 6y \leq 18$, $x \geq 0$, and $y \geq 0$ has:
DifficultMHT CET 2026
View SolutionThe objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at
The corner points of the feasible region are $A(0,0)$,$B(16,0)$,$C(8,16)$,and $D(0,24)$. The minimum value of the objective function $z = 300x + 190y$ is . . . . . . .
Consider the following statements:
Statement $(I)$: In a $LPP$,the objective function is always linear.
Statement $(II)$: In a $LPP$,the linear inequalities on variables are called constraints.
Which of the following is correct?
Statement $(I)$: In a $LPP$,the objective function is always linear.
Statement $(II)$: In a $LPP$,the linear inequalities on variables are called constraints.
Which of the following is correct?
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