The correct constraints for the given feasible region are:

  • A
    $y-x \geqslant 1, x+5 y \leqslant 10, x+y \geqslant 2, \quad x, y \geqslant 0$
  • B
    $y-x \leqslant 1, 2 x+5 y \leqslant 10, x+y \geqslant 1, x, y \geqslant 0$
  • C
    $y-x \geqslant 1, 2 x+5 y \leqslant 10, x+y \geqslant 1, x, y \geqslant 0$
  • D
    $x-y \leqslant 1, 2 x+5 y \geqslant 10, x+y \leqslant 1, x, y \geqslant 0$

Explore More

Similar Questions

There are two types of fertilisers $F_{1}$ and $F_{2}$. $F_{1}$ consists of $10\%$ nitrogen and $6\%$ phosphoric acid,and $F_{2}$ consists of $5\%$ nitrogen and $10\%$ phosphoric acid. After testing the soil conditions,a farmer finds that she needs at least $14\,kg$ of nitrogen and $14\,kg$ of phosphoric acid for her crop. If $F_{1}$ costs $Rs\,6/kg$ and $F_{2}$ costs $Rs\,5/kg$,determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost. What is the minimum cost?

Difficult
View Solution

In the following figure, the shaded region represents the system of constraints:

The shaded area in the figure below is the solution set for a certain linear programming problem. Then the linear constraints are given by:

There are two factories located at place $P$ and place $Q$. From these locations,a certain commodity is to be delivered to each of the three depots situated at $A, B$ and $C$. The weekly requirements of the depots are $5, 5$ and $4$ units respectively,while the production capacities of the factories at $P$ and $Q$ are $8$ and $6$ units respectively. The cost of transportation per unit is given below:
From/To$A$$B$$C$
$P$$160$$100$$150$
$Q$$100$$120$$100$

How many units should be transported from each factory to each depot in order that the transportation cost is minimum? What will be the minimum transportation cost?

Difficult
View Solution

$A$ man rides his motorcycle at the speed of $50 \, km/h$. He has to spend $Rs. \, 2$ per $km$ on petrol. If he rides it at a faster speed of $80 \, km/h$,the petrol cost increases to $Rs. \, 3$ per $km$. He has at most $Rs. \, 120$ to spend on petrol and one hour's time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.

Difficult
View Solution

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