Example 1. Two
students Ann and Carl work x and
y hours per week,
respectively. Together they can work at most 40 hours per
week. According to the rules for part timers Ann can work
at most 8 hours more that Carl. But Carl can work at most
6 hours more than Ann. There is an extra
constraint
. Determine
the region
for
these constraints.
1 (c). If Ann and Carl
both earn $16 per hour, respectively, then find their maximum
combined income per week.
Solution 1 (c).
Enter the linear function and the constraints.
![[Graphics:../Images/LinearProgrammingMod_gr_59.gif]](../Images/LinearProgrammingMod_gr_59.gif)
Graph the region
defined
by the constraints.
![[Graphics:../Images/LinearProgrammingMod_gr_62.gif]](../Images/LinearProgrammingMod_gr_62.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_63.gif]](../Images/LinearProgrammingMod_gr_63.gif)
The solution will occur at one of the vertices of the convex polytope. We now solve for these four points.
![[Graphics:../Images/LinearProgrammingMod_gr_65.gif]](../Images/LinearProgrammingMod_gr_65.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_67.gif]](../Images/LinearProgrammingMod_gr_67.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_68.gif]](../Images/LinearProgrammingMod_gr_68.gif)
Graph the level curves of the objective function.
![[Graphics:../Images/LinearProgrammingMod_gr_70.gif]](../Images/LinearProgrammingMod_gr_70.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_71.gif]](../Images/LinearProgrammingMod_gr_71.gif)
The solution point for the maximum is the furthest point in the
region in the direction of the gradient
.
Find the gradient vector
.
![[Graphics:../Images/LinearProgrammingMod_gr_75.gif]](../Images/LinearProgrammingMod_gr_75.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_77.gif]](../Images/LinearProgrammingMod_gr_77.gif)
![[Graphics:../Images/LinearProgrammingMod_gr_78.gif]](../Images/LinearProgrammingMod_gr_78.gif)
(c) John H. Mathews 2005