For the linear programming problem, $x + 2y \leq 10$, $3x + y \leq 12$, $x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

  • A
    $(0, 0)$ and $(4, 0)$
  • B
    $(0, 0)$ and $(0, 5)$
  • C
    $(4, 0)$ and $(\frac{14}{5}, \frac{18}{5})$
  • D
    $(0, 5)$ and $(\frac{14}{5}, \frac{18}{5})$

Explore More

Similar Questions

$A$ factory manufactures two types of screws, $A$ and $B$. Each type of screw requires the use of two machines, an automatic and a hand-operated one. It takes $4 \, \text{minutes}$ on the automatic and $6 \, \text{minutes}$ on the hand-operated machine to manufacture a package of screws $A$, while it takes $6 \, \text{minutes}$ on the automatic and $3 \, \text{minutes}$ on the hand-operated machine to manufacture a package of screws $B$. Each machine is available for at most $4 \, \text{hours}$ on any day. The manufacturer can sell a package of screws $A$ at a profit of $Rs. \, 7$ and screws $B$ at a profit of $Rs. \, 10$. Assuming that he can sell all the screws he manufactures, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.

Difficult
View Solution

The minimum value of the objective function $z = 4x + 6y$ subject to the constraints $x + 2y \geq 80$,$3x + y \geq 75$,and $x, y \geq 0$ is:

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

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

$A$ manufacturing company produces two items,$A$ and $B$. Each item must be processed by two machines,$I$ and $II$. Machine $I$ can be operated for a maximum of $10$ hours $40$ minutes ($640$ minutes). It takes $20$ minutes for an item $A$ and $15$ minutes for an item $B$. Machine $II$ can be operated for a maximum of $8$ hours $20$ minutes ($500$ minutes). It takes $5$ minutes for an item $A$ and $8$ minutes for an item $B$. The profit per item of $A$ is ₹ $25$ and per item of $B$ is ₹ $18$. The formulation of an $L.P.P.$ to maximize the profit (where $x$ is the number of items $A$ and $y$ is the number of items $B$) 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