Scribd Logo
Upload

Welcome to Scribd!

  • 362 views

    Worksheet 3.2 - Linear Programming

    Uploaded by

    Sullano Dwight
    This document contains 8 problems involving linear programming with objective functions and constraint regions. For each problem, the reader is asked to find the maximum or minimum value of the given objective function within the feasible region defined by the constraints. The problems provide graphs of the feasible regions and mathematical expressions for the objective functions and constraints.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Worksheet 3.2 - Linear Programming

    Uploaded by

    Sullano Dwight
    362 views3 pages
    This document contains 8 problems involving linear programming with objective functions and constraint regions. For each problem, the reader is asked to find the maximum or minimum value of the given objective function within the feasible region defined by the constraints. The problems provide graphs of the feasible regions and mathematical expressions for the objective functions and constraints.

    Original Title

    3 Activity Sheet.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 8 problems involving linear programming with objective functions and constraint regions. For each problem, the reader is asked to find the maximum or minimum value of the given objective function within the feasible region defined by the constraints. The problems provide graphs of the feasible regions and mathematical expressions for the objective functions and constraints.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    362 views3 pages

    Worksheet 3.2 - Linear Programming

    Uploaded by

    Sullano Dwight
    This document contains 8 problems involving linear programming with objective functions and constraint regions. For each problem, the reader is asked to find the maximum or minimum value of the given objective function within the feasible region defined by the constraints. The problems provide graphs of the feasible regions and mathematical expressions for the objective functions and constraints.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Finite Math B Name: _________________________________

    3.2 Linear Programming

    Worksheet 3.2 – Linear Programming


    The following graphs show regions of feasible solutions. Use these regions to find maximum and
    minimum values of the given objective functions.

    Use this feasible region for #1 & #2 1.) z = 3x + 2y

    2) z = x – 4y

    Use this feasible region for #3 & 4

    3) z = 0.35x + 1.25y

    4) z = 1.5x – 0.5y
    Find the Maximum or Minimum Value for the Objective Function for each set of constraints.
    y

    

    5. Maximize:
    

    z  8x  2 y 

    Subject to: 

    4 x  5 y  35 

    x  5 y  20 

    y0 

    x0 y

    


    
    x

               

    
    

    
    6. Minimize:
    
    z  x  2y

    Subject to: 

    3x  4 y  12

    x  2 y  10
    0 x4

           

    
    

    

    7. Minimize: 

    z  4x  7 y 

    Subject to:

    x  y 1
    3 x  2 y  18 

    x0

    y0

          

    

    

    8. Maximize: 

    z  5x  2 y 


    Subject to:

    4 x  y  16
    2 x  y  11 

    x3 
    y 8
             

    

    

    

    

    

    

    

    

    

    You might also like