Answer:
If we don't need to carry both types of carton, the optimal solution is 0 cartons of food and 1,800 cartons of clothes. This will help 10,800 people.
If both types of carton need to be carried, the optimal solution is 325 cartons of food and 500 cartons of clothes. This will help 7,225 people.
Step-by-step explanation:
This is a linear programming problem.
We have to maximize the number of people we are helping with the shipment.
The number of people helped can be expressed as:
[tex]P=13F+6C[/tex]
being F: cartons of food, and C: cartons of clothes.
The restrictions are Volume and Weight.
The maximum volume allowed is 9000 cubic feet.
We can express this as:
[tex]20F+5C\leq9,000[/tex]
The maximum weight allowed is 23,000 pounds.
We can express this as:
[tex]40F+20C\leq23,000[/tex]
Also, we know that both quantities F and C are positive:
[tex]F,C\geq0[/tex]
We can graph the restrictions to limit the feasible solution region (see picture attached).
There are 3 points that are defined by the saturation of 2 constraints (Note: saturation means that the restriction is expressed in this point with an equal sign).
In one of this points lies the combination of food and clothes cartons that maximizes the people helped.
The points are:
Point 1: F=0, C=1,800
[tex]P=13F+6C=13\cdot 0+6\cdot 1,800=0+10,800\\\\P=10,800[/tex]
Point 2: F=575, C=0
[tex]P=13F+6C=13\cdot 575+6\cdot 0=7,475+0\\\\P=7,475[/tex]
Point 3: F=325, C=500
[tex]P=13F+6C=13\cdot 325+6\cdot 500=4,225+3,000\\\\P=7,225[/tex]
If we don't need to carry both types of carton, the optimal solution is 0 cartons of food and 1,800 cartons of clothes. This will help 10,800 people.
If both types of carton need to be carried, the optimal solution is 325 cartons of food and 500 cartons of clothes. This will help 7,225 people.
