The objective function $Z = 4 x_1 + 5 x_2$,subject to $2 x_1 + x_2 \geq 7$,$2 x_1 + 3 x_2 \leq 15$,$x_2 \leq 3$,$x_1, x_2 \geq 0$ has minimum value at the point

  • A
    On $x_1$-axis
  • B
    On $x_2$-axis
  • C
    At the origin
  • D
    On the line parallel to $x_1$-axis

Explore More

Similar Questions

$A$ factory makes tennis rackets and cricket bats. $A$ tennis racket takes $1.5\, \text{hours}$ of machine time and $3\, \text{hours}$ of craftsman's time in its making, while a cricket bat takes $3\, \text{hours}$ of machine time and $1\, \text{hour}$ of craftsman's time. In a day, the factory has the availability of not more than $42\, \text{hours}$ of machine time and $24\, \text{hours}$ of craftsman's time. What number of rackets and bats must be made if the factory is to work at full capacity?

Difficult
View Solution

$A$ factory makes tennis rackets and cricket bats. $A$ tennis racket takes $1.5 \text{ hours}$ of machine time and $3 \text{ hours}$ of craftsman's time in its making,while a cricket bat takes $3 \text{ hours}$ of machine time and $1 \text{ hour}$ of craftsman's time. In a day,the factory has the availability of not more than $42 \text{ hours}$ of machine time and $24 \text{ hours}$ of craftsman's time. If the profit on a racket and on a bat is $Rs. 20$ and $Rs. 10$ respectively,find the maximum profit of the factory when it works at full capacity.

Difficult
View Solution

$A$ manufacturer produces two models of bikes: Model $X$ and Model $Y$. Model $X$ takes $6$ man-hours to make per unit,while Model $Y$ takes $10$ man-hours per unit. There is a total of $450$ man-hours available per week. Handling and marketing costs are $Rs. 2000$ and $Rs. 1000$ per unit for Models $X$ and $Y$ respectively. The total funds available for these purposes are $Rs. 80,000$ per week. Profits per unit for Models $X$ and $Y$ are $Rs. 1000$ and $Rs. 500$ respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.

Difficult
View Solution

The solution of the linear programming problem,maximize $Z = 3x_{1} + 5x_{2}$ subject to $3x_{1} + 2x_{2} \leq 18$,$x_{1} \leq 4$,$x_{2} \leq 6$,$x_{1} \geq 0$,$x_{2} \geq 0$ is:

Difficult
View Solution

The maximum value of the objective function $z=4x+5y$ subject to the constraints $2x+3y \leq 12$,$2x+y \leq 8$ and $x \geq 0, y \geq 0$ is:

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