Answer:
Step-by-step explanation:
First you can notice the y-intercept is 4. Then notice how the y value increases exponentially based on the x valie, making it non-linear, rather a porabla.
The process is also known as recurssion which is most often the term used in computer science.
Both terms mean that you do something to the previous term to get to the next term. In general terms it is written like this
fn = f_(n - 1) + d for an arithmetic progression. The series begins with n =2 , 3 , 4 , 5 , 6 ...
f1 is defined as 7
so f2 = f_(2 - 1) - 2 or
f2 = f_1 - 2
f2 = 7 - 2
f2 = 5
f3 = f_(3 - 1) - 2 or
f3 = f_2 - 2
f3 = 5 - 2
f3 = 3 and so on. Computers handle this much better than people do. They can go through a thousand such calculations most of the time in less than a second.
9514 1404 393
Answer:
- Constraints: x + y ≤ 250; 250x +400y ≤ 70000; x ≥ 0; y ≥ 0
- Objective formula: p = 45x +50y
- 200 YuuMi and 50 ZBox should be stocked
- maximum profit is $11,500
Step-by-step explanation:
Let x and y represent the numbers of YuuMi and ZBox consoles, respectively. The inventory cost must be at most 70,000, so that constraint is ...
250x +400y ≤ 70000
The number sold will be at most 250 units, so that constraint is ...
x + y ≤ 250
Additionally, we require x ≥ 0 and y ≥ 0.
__
A profit of 295-250 = 45 is made on each YuuMi, and a profit of 450-400 = 50 is made on each ZBox. So, if we want to maximize profit, our objective function is ...
profit = 45x +50y
__
A graph is shown in the attachment. The vertex of the feasible region that maximizes profit is (x, y) = (200, 50).
200 YuuMi and 50 ZBox consoles should be stocked to maximize profit. The maximum monthly profit is $11,500.
Answer:
thx for the free points
sorry that people are giving the wrong answers. thats happening to me too
2x+3x=180
5x=180
x=180/5
x=36