Linear Programming
By: Sara Greelman and Cindy Vo
Problem
The high school senior class are going to
rent busses and vans for a class trip.
 Each bus transports 40 students and 3
chaperones and costs $1200 each.
 Each van can transport 8 students and 1
chaperone for $100.
 They must plan for at least 400 students
and at most 36 chaperones.

Variables
X= Busses
 Y= Vans

Constraints
X≥0
Y≥0
40x+8y≥ 400
3x+y≤ 36
Objective
$=1200x+100y
We are trying to find the minimal
transportation costs
Graph
Solution
(10,0)
$=1200(10)+100(0) or $12000
(12,0)
$=1200(12)+100(0) or $14400
(7,15)
$=1200(7)+100(15) or $9900
Summary
We plugged in the points from our graph
into the objective function.
 The points created a triangle or our
feasible region.
 They should rent 7 busses and 15 vans for

$9900.
