Scribd
Upload
22 views2 pages

Linear Programming 02 Optimize The Objective Function

Linear_Programming_02_Optimize_the_Objective_Function

Uploaded by

Bạch Quang Minh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

Linear Programming 02 Optimize The Objective Function

Linear_Programming_02_Optimize_the_Objective_Function

Uploaded by

Bạch Quang Minh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Linear_Programming_02_Optimize_the_Objective_

Function
TI PROFESSIONAL DEVELOPMENT STUDENT
We suggest that you do ‘20_Linear_Programming_01_Graph_the_Feasible_Region’ before doing
this activity.

Linear Programming Applied Problem: Banjos

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.

Model A Model B Hours available


Machine hours 6 12 144
Man hours 8 8 136

The maximum number of model A’s that can be made is 14.


How many banjos of each type should be made in order to make a maximum profit?
What is that maximum profit? Justify your answers.

1. 2. The inequalities and the optimization 3. The graph of the feasible


Let x represent the
function are: region is illustrated below:
number of model A
banjos.

Let y represent the


number of model B
banjos.

4. We need to trace to 5. Display the graph. 6. Press 1 for Point of Interest


“points of interest”, Press y r ~ Trace.
that is, to “corners” or
points of intersection
in the feasible region.
How to do this is
explained in steps 5
– 7.

Notice that the ordered pair


displayed is the point at the
intersection of Y1 and Y2.

©2022 Texas Instruments Incorporated 1 education.ti.com


Linear_Programming_02_Optimize_the_Objective_
Function
TI PROFESSIONAL DEVELOPMENT STUDENT

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·Í
To illustrate this, go to the
home screen, pressing y
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.

Then evaluate those We suggest you keep track of


coordinates in the objective the ordered pairs and the profit
function. in the table below.

Then decide which


combination of models of
banjos yields the maximum
profit.

Ordered Pair Profit

Answer the two questions asked in the original problem. Answer in complete sentences.

©2022 Texas Instruments Incorporated 2 education.ti.com

You might also like