Scribd
Upload
79 views1 page

Linear Programming Quiz

Uploaded by

Farhana Sabrin
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
79 views1 page

Linear Programming Quiz

Uploaded by

Farhana Sabrin
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/ 1

Name Date Class

LESSON Practice B
3-4 Linear Programming
Maximize or minimize each objective function. Y



1. Maximize P ⫽ 5x ⫹ 2y 
yⱖ0
for the constraints x ⱖ 0
y ⱕ ⫺x ⫹ 10
y ⱕ 2x ⫹ 1
{ 


 X
 10, 0 
          

Y


2. Minimize P ⫽ 4x ⫹ 6y 

0ⱕxⱕ4 

for the constraints y ⱖ 1


y ⱖ ⫺x ⫹ 4 { 





 3, 1  

Solve. 
         
X


3. A grocer buys cases of almonds and walnuts. Almonds are packaged 20 bags
per case. The grocer pays $30 per case of almonds and makes a profit of $17
per case. Walnuts are packaged 24 bags per case. The grocer pays $26 per
case of walnuts and makes a profit of $15 per case. He orders no more than
300 bags of almonds and walnuts together at a maximum cost of $400.
xⱖ0
a. Write the constraints. Use x for the number of
cases of almonds ordered and y for the number
of cases of walnuts ordered.
b. Graph the constraints.
{ yⱖ0
20x ⫹ 24y ⱕ 300
30x ⫹ 26y ⱕ 400
7HOLESALE.UT/RDERS
Y

c. Write the objective function for the profit.


P ⫽ 17x ⫹ 15y 
#ASESOF7ALNUTS


d. How many cases of almonds and walnuts 
maximize the grocer’s profit? 

9 cases of almonds, 5 cases 

of walnuts 


 X
          
#ASESOF!LMONDS

Copyright © by Holt, Rinehart and Winston.


All rights reserved. 28 Holt Algebra 2

a207c03-4_pr.indd 28 12/15/05 6:35:55 PM


Process Black

You might also like