TATIANA PERRAULT

LINEAR PROGRAMMING
PROJECT - HONORS MATH III

THE PROBLEM: #1
Brad is an organizer of the Bolder Boulder 10K race and
must hire workers for one day to prepare the race packets.
Skilled workers cost $60 a day, and students workers cost
$40 a day. Brad can spend no more than $1440. He needs at
least 1 skilled worker for every 3 students, but only 16 skilled
workers are available. Skilled workers can prepare 25
packets per hour, and students can prepare 18 packets per
hour. Find the number of each type of worker that Brad
should hire to maximize the number of packets produced.

MY CONSTRAINTS
60x + 40y 1140
This constraint came from the amount of money Brad has to spend on each worker a day.
x 16
This constraint came from only being able to have 16 workers a day.
y 3x
This constraint came from needing 1 skilled worker for every 3 students. Since X is skilled
workers, you multiply X by 3 to find how many students you can have.
y0
x0
Objective: P = 25x + 18y
This is the objective because a skilled worker can make 25 packets an hour, and a student can
make 18 packets an hour.

MY POINTS
(8, 24)
(16, 12)
(16, 0)
(0, 0)

The objective function states that a

skilled worker can make 25 packets
an hour, while a student can make 18
packets an hour.

To maximize profits, Brad

should hire 8 skilled
workers and 24 students.