help please
let x = # of type A y = # of type B type A brings in a profit of $45 each, so selling x of them will gain you 45x dollars type B brings in a profit of $35 each, so selling y of them will gain you 35y dollars In total, you'll get a profit of 45x+35y dollars This must be at least $3850, so 45x+35y >= 3850
you sell a total of x+y printers, so because "You expect to sell at least 100 laser printers this month", this means x+y >= 100
if you graph those two inequalities, along with x >= 0 y >= 0 you'll get a feasible region and the vertices of that feasible region will be where the min cost occurs
it turns out that there are 3 vertices and they are (0, 110), (35, 65), (100, 0) these are the points where the boundary lines intersect
now what you do is plug each vertex into the cost function C = 86x + 130y and see which vertex produces the smallest value of C
How's that possible?
The large tiles used can't even fit the largest area of mosaic
@.Sam.
theses are answer we will obtain 0 small tile 6 large tiles minimum cost $27
If the mosaic area is 60x40 then that could be possible
Because for large tiles is 12x6, so when we have 5 of them then it's 60x30, which is inside the 60x40
we have to solve iit through linear function
@.Sam.
Area of mosaic=2400 \[12x+6y \leq 2400\]
how did we get 2400
and mostt precisely how did we got 60 and 40
@ash2326
Join our real-time social learning platform and learn together with your friends!