00:02
So we are going to let x to be equal to the acres of land increase for acres of land increased on acres of land increased for crop a and you are going to let y be equal to the acres of land for crop b.
00:41
Profits per acre on crop a is 185 and profits per acre for crop b is 2 .45 and profits per acre for crop b is 2 .45.
00:50
So the objective function p becomes 805, 185 x plus 2, 405.
01:03
405 y.
01:07
So now the total acre, the total 150 acres of land for raising the crops becomes x plus y, which is less than or equal to 150.
01:20
The number of days takes to trim crop a is x and number of days to trim prop b is 2y so the total available um days is 240 so this becomes um x plus 2y that is not equal to 240 the number of these takes to pick cup a is 0 .3x and the number of these takes to pick cup b is 0 .1.
01:57
So the total number of these is 30.
01:59
So we are going to get 0 .3x plus 0 .1y.
02:04
That is not equal to 30.
02:08
Now, the given data as a linear programming problem is this.
02:14
And we have an objective function.
02:16
Y to be 300 x plus 500 and y and we have the flowing constraints so you have x greater than or equal to 0 y greater than or equal to 0 you have x plus y less or equal to 150 you have x plus 2 y less or equal to 240 you have x plus 2 y less or equal to 240 we have 0 .3 x plus 0 .1y less so equal to 30...