Question

This Halloween, Mr. Goodman wants to make kids in Chicago happy by supplying apples, banana, and cherries as they trick and treat. You've been asked by his associates to construct a linear programming problem that will maximize the number of happy children with the following information.

1. Apples, banana, and cherries are transported in a truck that can hold up to 100 crates of fruit.

2. The truck can carry up to 2400 lbs in total weight.

3. Each crate of apples weighs 25 pounds and makes 200 children happy.

4. Each crate of banana weights 32 pounds and makes 150 children happy.

5. Each crate of cherries weights 20 pounds and makes 300 children happy.

6. The number of crates of cherries can be no more than the crates of apples and banana combined.

7. At least 20 crates of banana must be used due to his agreement with banana producers in New York.

Note:

Only set up the constraints.

1. Use x = the number of crates of Banana, and y = the number of crates of Cherries.

2. Use only TWO variables in your final setup.

Answer 1