Math 3B 2022

Eastside Westside Review Name___________________________

Use the matrices below to answer the following questions, if possible. If not, explain why
it’s not possible. Make sure you can do these both by hand and in the calculator.

1) 2) 3) 4) 5)

1) The two matrices cannot be added because they do not have precisely the same
dimensions.

2)

3)

4)

5)

6) Solve by graphing.

Maximize: 4x+2y
Corner Point 4x+2y
(-6.25, -1) -27
(-1.25, 3) 1
(4, -1) 14
(4, 3) 22

The maximum output from 4x+2y is 22, which occurs at x=4, y=3.

7)

8)

Coefficients with common factors might lead you to choose to eliminate f.

Multiply the top equation by -2 and rewrite:

Add:

Back substitute

Solution:

9)

10)

You can use matrices to solve this. In doing so, you will see that this system has NO
solution. These three planes do not meet at a single point.

11)

After using matrices to solve this, a= .49, b=.94, c=2.18, d=-3.24

12) A computer store sells two different types of computers, A and B. Computer A costs
$2000 and Computer B costs $2200. If a total of 27 computers are sold and $56,800 is
collected from these sales, how many Type A computers are sold?

(# sold)
(Sales)

Solve by elimination: multiply top by -2000.

Add:

Then, since:

The store sold 13 of computer A and 14 of computer B

13) The senior classes at High School A and High School B planned separate trips to New
York City. The senior class at High School A rented and filled 1 van and 6 buses with 372
students. High School B rented and filled 4 vans and 12 buses with 780 students. Each
van and each bus carried the same number of students. How many students can a van
carry? How many students can a bus carry?

Let v be the number of students a van can carry and b be the number of students a bus
can carry.

Multiply top by 2:

Add:

Substitute:

A van can carry 18 students, and a bus can carry 59 students.

(don’t make the mistake of saying “18 vans and 59 buses” – go back to the place where
you defined your variables.)

14) Below is a pre-written set of constraints for a linear programming problem. Consider
the following questions:
a) How many constraints will you have to combine at a time to find the possible
corner points?

The constraints need to be grouped by threes since there are three variables (two planes
do not meet at a single point)
 b) Which constraints are required in all combinations that you test?
Constraint B must be in every combination (it has an equal sign)

c) Which combinations of constraints can you tell will have an inconsistent answer?
Examples:
Any combos with EF will result in an inconsistent answer because x cannot equal 0 and
30.
Any combos with DH will result in an inconsistent answer because z cannot equal 0 and
15.
Constraint combo BFG will result in an inconsistent answer because if x=0 and y=0, then
x+y will not sum to 50.

Be prepared to explain your reasoning for any of the above in a few well-constructed
sentences.

Constraints:

a) e)
b) f)
c) g)
d) h)

15) For the next pick-up basketball game, there are 7 people (Al, Betty, Carl, Dan, Ella,
Fran, Gus) that want to play, but only 3 people can be on a team. Make an organized list
of all the possible team combinations.
ABC, ABD, ABE, ABF, ABG
ACD ACE ACF ACG
ADE ADF ADG
AEF AEG
AFG
BCD BCE BCF BCG
BDE BDF BDG
BEF BEG
BFG
CDE CDF CDG
CEF CEG
CFG
DEF DEG
DFG
EFG
16) Find the equation of a plane in the form of z = ax +by +c whose graph would pass
through each of the three coordinate points below. .

a) (–9, –6, 2), (–8, 9, 4), and (–2, 3, -5)

17) Name a point that is behind the xy plane and to the left of the yz plane.

(-3, 4, -1)

18) Name a point that is beneath the xz plane and to the right of the yz plane.

(3, -1, 2)

19) Name a point that is above the xz plane and behind the xy plane.

(2, 1, -5)

20) Justify / Counterexample. If a statement below is true, explain why. If it is false,

provide a specific counterexample.
(a) If two planes intersect, they will always meet in a line.

False – they can be the same plane

(b) If two distinct planes intersect, they will always meet in a line.
True – if two distinct planes intersect, it MUST be a line. See (c)

(c) If two distinct planes intersect, they can never meet in a single point.

True – they must meet at a line, not a single point.

(d) If three distinct planes intersect, they will always meet in a line.

False – they could meet at a line OR single point. For example, the xz-plane, yz-plane, and

xy-plane meet at (0,0,0).

(e) Three randomly selected planes will always have at least one point in space in which

they all meet.

False, they could be parallel, or two planes could meet at a line while the third plane is

parallel to this line.

(f) Three randomly selected points will always determine a unique plane.

False – this is ONLY true if the three points are not collinear (share a same line)-- similar to

how two points determine a line, three points will determine a flat surface (plane).

Solve for the values of x, y, and z that satisfy the following systems and describe what the
graphs would look like:

21) 22)

2 coinciding planes, 1 intersecting plane; 2 parallel planes and one plane

infinite solutions intersecting the other two; no solutions
23) Use the isometric graph paper to draw the following feasible regions when x, y & z > 0 :

x+y+z<6 2x + 3y + 2z < 12
3y = 12 x<4
3y + 2z < 6

24) Joe is having a fundraiser for a trip to go to Willy Wonka’s Chocolate Factory. He plans
to sell cans of soda and chocolate bars at school to raise the money. He is selling the soda
for $1 and the chocolate for $1. His uncle gave him $100 to spend to buy his supplies to sell.
Cans of soda cost $0.50 and chocolate bars cost $0.75. He can carry at most 100 sodas
and 100 chocolate bars in his book bag. He wants to sell at least twice as many chocolate
bars as cans of soda because he wants to share the joy of chocolate with the world. How
many sodas and chocolate bars should he buy to sell to maximize his profit?

c = # of chocolate bars
s = # of soda cans

A. .75c+.5s<100 (purchasing supplies)

B. s<100 (bookbag size)
C. c<100 (bookbag size)
D. c>2s (he loves chocolate!) (remember – the coefficient goes on the number he wants to sell
less of to keep everything balanced)
E. s>0

Profit: .25c+.5s (have to subtract the purchase price from the selling price)

Combination testing, checking whether they meet all constraints:

AB:
.75c+.5s=100
s=100; c=66 ⅔ (Violates D)

AC
c=100, so s=50
AD
.75(2s)+.5s=100,
so s=50, c=100

AE
s=0, c=133 ⅓ (Violates C)

BC
s=100, c= 100 (violates D)

BD
s=100, c=200 (violates A)

BE
Inconsistent

CD
c=100, s=50

CE
c=100, s=0

DE
c=0, s=0

Plug into profit equation, 100 bars of chocolate and 50 cans of soda yields the biggest
profit of $50.

25) Given the constraints for a situation, find all combinations, solve each combination,
identify the corner points and find the solution that will maximize the profit.

a + b + 2c = 80
b + c ≤ 52
c ≥ 10
a≥0
b≥0
c≥0

Profit = 3a + 5b + 7.5c
26) A manufacturer produces three models of bicycles. The time (in hours) required for
assembling, painting, and packaging each model is as follows.
Model A Model B Model C
Assembling 2 2.5 3
Painting 1.5 2 1
Packaging 1 0.75 1.25

They can spend up to 4006 hours assembling and 2495 hours painting, but must spend
exactly 1500 packaging to ensure that all the packagers get their minimum hours. The
profit per unit for each model is $45 (Model A), $50 (Model B), and $55 (Model C). How
many of each type should be produced to obtain a maximum profit?