Question

Milena wants to power toy cars and helicopters using batteries. Her goal is to power at least 11

toys (condition A) with at most 60 batteries (condition B).

The graph represents the constraints on the number of cars C and helicopters H Milena powers.

What is the greatest number of helicopters Milena can power while meeting both her constraints?

Answer 1

[AI-generated answer — Bot GPT 3.5]

To determine the greatest number of helicopters Milena can power while meeting both conditions A and B, we need to find the point on the graph that satisfies both conditions.

Condition A: C + H ≥ 11
Condition B: 2C + 3H ≤ 60

First, let's find the intersection points of the two lines represented by the constraints.

1. C + H = 11
Let C = 0, then H = 11.
So, the point (0, 11) lies on the line C + H = 11.

2. 2C + 3H = 60
Let C = 0, then H = 20.
So, the point (0, 20) lies on the line 2C + 3H = 60.

Next, let's check which intersection point lies in the feasible region (i.e. below both lines). As (0, 20) lies in the feasible region, Milena can power 20 helicopters while meeting both her constraints.