Algebra 2 First Semester Exam Review

Find the values of x and y that maximize the objective function P = 3x + 2y for the graph. What is the maximum value?

• maximum value at (5, 4); 32
• maximum value at (0, 8); 16
• maximum value at (9, 0); 27
• maximum value at (0, 0); 0

Your computer supply store sells two types of inkjet printers. The first, type A, costs $241 and you make a $25 profit on each one. The second, type B, costs $103 and you make a $11 profit on each one. You can order no more than 140 printers this month, and you need to make at least $2660 profit on them. If you must order at least one of each type of printer, what are the constraints to minimize the cost?

• x ≥ 0, y  ≥ 0
   x + y ≥ 140  ;
  25x + 11y ≥ 2,660
• x ≥ 0, y  ≥ 0 
   x + y ≤ 140  ; 
  25x + 11y ≤ 2,660 
• x ≥ 0, y  ≥ 0 
   x + y ≤ 140  ; 
  25x + 11y ≥ 2,660 
• x ≥ 0, y  ≥ 0 
   x + y ≥ 2,660  ; 
  25x + 11y ≥ 140 

What is the objective function in Problem no. 2 ?

• C = 103x +241y
• C = 25x + 11y
• C = 140x + 103y
• C = 241x + 103y

You have to graph the inequalities to find the ___________________ for a linear
programming problem.

• constraints
• objective function
• feasible region
• vertices

The intersections of the constraint graphs are the __________ of the feasible region.

• constraints
• objective function
• feasible region
• vertices

The equation P = 5x + 10y is an example of an ___________ where P stands for profit.

• constraints
• objective function
• feasible region
• vertices

The inequalities x – 2y ≤ 4 and 2x + y ≤ 6  are the _____________.

• constraints
• objective function
• feasible region
• vertices

The ________________ of the feasible region are the points where the least and greatest values for the objective function occur.

• constraints
• Linear Programming
• feasible region
• vertices

_____________ is a method for finding a minimum or maximum value of some quantity, given a set of constraints.

• constraints
• Linear Progamming
• feasible region
• vertices

The limits or restrictions are also called __________________.

• constraints
• Linear Programming
• feasible region
• vertices