Use linear programming to solve the problem.
A company produces two models of lamps, A and B. They can
produce up to 1500 lamps each day using a total of 60 hr of
labor. It takes 3 min of labor to make one model A lamp and
2 min of labor to make one model B lamp. Graph the
feasibility
region and label the vertices.
How many of each model should be made daily in order to
maximize the company’s profit if the profit on a
model A lamp is $4 and the profit on a model B lamp is $3?
_______________________________
18. Find the value of each variable in the equation 18. _______________________________
[ ] [ ]
3 5 2 4 2 5 2 .x y z x z– + – = +
Perform each operation, whenever possible.
19.
2 1 3 1 2 3
1 2 –1 2 – 2 1
0 1 0 0 0 1
é ùé ù
ê úê ú
ê úê ú
ê úê ú
ê úê ú
ë ûë û
19. _______________________________
20.
1 –8 10 –1 9 12 0 2 –1
5 2 –3 8 6 7 5 6 3
– 4 0 0 –3 4 5 –7 11 2
é ù é ù é ù
ê ú ê ú ê ú
ê ú ê ú ê ú
++
ê ú ê ú ê ú
ê ú ê ú ê ú
ë û ë û ë û
20. _______________________________
21.
3 1 2 1 2 2
53
4 3 2 5 5 3
é ù é ù
—
ê ú ê ú
+
ê ú ê ú
– – – –
ë û ë û
21. _______________________________
22. If A is a 4
4 matrix, find the size 22. _______________________________
of the product AB and the product BA, if these products can
be found.
Find the inverse, if it exists, of each matrix.
23.
23. _______________________________