The corner points of the feasible region determined by the system of linear constraints are $(0,0), (0,40), (20,40), (60,20), (60,0)$. The objective function is $z=4x+3y$. Compare the quantity in Column $A$ and Column $B$.
Column Value $A$. Maximum of $z$ $300$ $B$. Constant value $325$
| Column | Value |
| $A$. Maximum of $z$ | $300$ |
| $B$. Constant value | $325$ |
- AThe quantity in column $A$ is greater
- BThe quantity in column $B$ is greater
- CBoth quantities are equal
- DThe relation cannot be determined on the basis of given information
Explore More
Similar Questions
The following five inequalities form the feasible region: $2x - y \leq 8$,$x + y \leq 20$,$-x + y \geq -10$,$x \geq 0$,$y \geq 0$. Which of the following is a redundant constraint?
Easy
View SolutionThe corner points of the feasible region of the objective function $Z = 3x + 9y$ are $(0, 10)$,$(5, 5)$,$(15, 15)$,and $(0, 20)$. Then,the minimum value of $Z$ is:
The objective function of a Linear Programming Problem $(LPP)$ defined over a convex set attains its optimum value at:
The shaded region in the given figure is a graph of $.....$
Medium
View SolutionThe corner points of the feasible region determined by the following system of linear inequalities: $2x + y \leq 10$,$x + 3y \leq 15$,$x, y \geq 0$ are $(0,0)$,$(5,0)$,$(3,4)$,and $(0,5)$. Let $Z = qx + py$,where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $Z$ occurs at both $(3,4)$ and $(0,5)$ 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