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$

  • A
    The quantity in column $A$ is greater
  • B
    The quantity in column $B$ is greater
  • C
    Both quantities are equal
  • D
    The relation cannot be determined on the basis of given information

Explore More

Similar Questions

Maximize and minimize $Z = 3x - 4y$ subject to the constraints $x - 2y \leq 0$,$-3x + y \leq 4$,$x - y \leq 6$,and $x, y \geq 0$.

Difficult
View Solution

The objective function of a Linear Programming Problem $(LPP)$ defined over a convex set attains its optimum value at:

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 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