Linear Programming 02 Optimize The Objective Function TEACHER
Linear Programming 02 Optimize The Objective Function TEACHER
Function
TI PROFESSIONAL DEVELOPMENT TEACHER NOTES AND SOLUTIONS
We suggest that you do ‘20_Linear_Programming_01_Graph_the_Feasible_Region’ before doing
this activity.
A banjo factory makes two models of banjos: a model A and a model B. For each model A that is sold
there is a profit of $500. For each model B that is sold there is a profit of $300.
The table below shows the number of machine hours and man hours are needed to produce one banjo of
each model. It also shows the maximum number of hours that are available.
7. The displayed value of x, 8. Recall that the function to 9. Explain what this means in
10, is stored in the variable x, optimize is stored in Y5. terms of the problem we are
while 7 is stored in the To evaluate Y5 using these values solving.
variable, y. for x and y:
ƒ r·Í If we make and sell 10 model
To illustrate this, go to the A banjos and 7 model B
home screen, pressing y banjos, the profit is $7100.
z.
Press „ Í. Then
press ƒ 1 Í.
10. There are 5 “corner” 11. To find other points, here is the 12. Use the 4 direction keys,
points on the feasible region. procedure: ~ | † }
We want to find the s yr ~ 1 to “move” to the other points of
coordinates of the other 4 intersection.
corner points.
Note: we do not need to find Then evaluate the objective
the coordinates of the origin. function that is stored in Y5.
If we make and sell 0 model A If we make and sell 14 model If we make and sell 14 model
banjos and 12 model B A banjos and 3 model B A banjos and 0 model B
banjos, the profit is $3600. banjos, the profit is $7975. banjos, the profit is $7000.
Answer the two questions asked in the original problem. Answer in complete sentences.
14 model A banjos and 3 model B banjos need to be made and sold in order to maximize profit.
That maximum profit is $7900.