# Math

Q uestion

## Algebra 125

Description:

Math125 Spring 2016, Written HW 4 - Final Exam Practice. Due Friday last day of class in Lecture. Counts 20 points toward HW Score. This Page must be stapled to front.

Math 125               Final Exam Practice

Include your Name and math125 classid.

No late homeworks will be accepted.

1. List the Intercepts of the Inequality and then sketch the graph using the Math 125 method of shading

18x   10 y    90

1. USING ALGEBRA(meaning no calculators), find the solution to the System of Equations.

4x   5 y   16

6x    y    7

1. Solve the Linear Programming Problem.

Graph the Inequalities and determine the Feasible Set.  SHOW WORK.

Clearly mark your Axes and label graphed points with coordinates for full credit.

Maximize : 1500   8x   3 y  subject  to

5x    y   360 x   3 y   180 x    y   80

x   0 , y    0

1. DigginDeep Mining company has to fill an order for 40 tons of iron ore and 18 tons of cooper ore. They operate two mines producing both ores. Mine I yields four tons of iron and one ton of copper and costs \$3200 per day to operate, while mine II yields two tons of iron and two tons of copper and costs

\$2600 per day to operate.  Determine how many days each mine should be used to fill this order at the least total cost.

SET UP(do NOT solve) a Linear Programming Problem for this situation.

1. Solve each System of Equations using the “RREF” function on your calculator. Show your augmented

matrix and the resulting one from RREF, plus your solution.

x   2 y   3z      14

1. a) x y   8z   10

x   y   18z    3

x1   x2   x3   15

1. b) 2x1 3x2   2x3    27

2x1   3x2   3x3      30

4x   y   z      14

1. c) 2x y   z    6

5x    y   2z   18

1. Write each Elementary Row Operation in notational values and then perform it on the matrix, using the original Matrix each time.

3     2

 12 7 2 0 4 5 1 3

3

2     6     5

6

1       2

3     7     5

1. a) Multiply Row 4 by positive three
2. b) Add minus 2 times row four to row one c) Add 5 times row one to row three

1. Graph, BY HAND, the Feasible Set of the system below.

x   2 y   36

x    y    20

x   0,

y    4

1. Given the following matrices, answer the questions below. You may use a calculator.

3     8     1                                                  7

2

2      3

2     5

6

4   8

1

A

B      9

2     6

C

D

8      1

E

4

5                                              1      4      9                                       5    3     7

5    7     3

5     6

1. a) Find: 2C – 3E
2. b) Find the product
3. c) Is BDECA possible? Show why or why not

 2 3 4 1 0 5 2 7 8 2 4 6 1 4 6 4

1. Pivot on the element in Row 3 and Column 2, BY HAND:

13

18                        10     7

1. If

A

and   B                        , and   2A – C = B, find the matrix C.

6     17                        16

23

You may use a calculator, but show any commands used.

1. A certain economy has three industries: metals, plastic, and wood. To produce \$1 of output, the metals industry needs \$0.08 of its own output, \$0.03 from plastics, and \$0.07 from wood. To produce \$1 of output, the plastic industry needs \$0.11 of its own output and \$0.02 from wood.  To produce \$1 of output, the wood industry needs \$0.10 of its own output, \$.05 from metals, and \$0.04 from plastic.

If the population needs(in Millions) \$32 of metal, \$25 of plastic, and \$40 of wood, how much of each must be produced to satisfy this demand?

1. a) Name and show ALL relevant matrices
2. b) Use X   I    A  1 D (calculator allowed) to determine production levels, rounded to the nearest tenth of a Mi

1. The Matrices below are Inverses of one another. Show ALL WORK in solving the system that follows,

USING the

X     A  1 B method.

2     2     1                  2     1      3

2x    y   3z    4

1   1

1

and

1     0

1

x   z      2

2    1    1

3       2     4

3x   2 y   4z   8

1. A plane carries two types of packages. Type A weighs 140 pounds and takes up 3 cubic feet of space and generates \$175 in revenue, while a Type B package weighs 185 pounds and takes up 5 cubic feet, generating revenues of \$240 per package. The plane is limited to 6000 total pounds in 300 total cubic feet of space.  Construct a full Linear Programming problem with an Objective function and ALL necessary constraints. DO NOT SOLVE.

1. The Tablette Corporation makes tablet computers at plants in Thailand and Malaysia. At the Thailand plant, unit costs are \$79 and fixed costs are \$9000, while in Malaysia unit costs are \$71 and fixed costs are \$9400.

1. a) If Tablette needs 600 tablets made, which plant does so at a lesser cost? JUSTIFY YOUR ANSWER b) If 1000 tablets need to be made, but total costs at each plant must be equal, how many should be made at each of the plants?

1. A home appliance manufacturer has been selling a kitchen stove model several markets and wishes to enter new markets. Atlanta has 6.1 million people and they sold 13,286 stoves, Tampa has 2.8 million with 5,123 sold, Miami has 6.4 million with 17,522 sold, Charlotte(NC) has 2.5 million with 4,848 sold, and Greenville(SC) has 1.4 million with 3,613 sold.

1. a) Using Population figures in Millions and sales as they are given, use LinReg in constructing the Least

Squares Line of Best Fit for this data set.  Round-off values to the nearest thousandth.

1. b) Use your line to predict the sales generated by entering a market like Orlando with 2.9 million peopl c) What sized market does your model suggest is necessary to sell 20,000 units?

1. Use the graphing methods of Chapter 3 to solve the Linear Programming problem below.

SHOW ALL WORK FOR FULL CREDIT.  Your calculator’s graph IS NOT acceptable.

Minimize : 900   5x   7 y  subject to

2x   4 y    64

6x   2 y    72

x   4 y    44

x   0,

y    0

1. A new wildlife refuge is being populated with animals, specifically lions and tigers and bears(Oh My!). The park manager knows he can fit exactly 150 animals total. His experience tells him to have at least twice as many lions as tigers.  Area limitations suggest he acquire no more bears than tigers. To make sure the public is likely to see each species during their visit, he wants at least 25 of each.  Lions

cost \$40/day to care for, tigers cost \$30, and bears cost \$35.  Help the manager build a population meeting his needs at the lowest daily cost.

Set up the Linear Programming Problem using only TWO variables. DO NOT SOLVE.

1. Furniture Factory produces tables, chairs, and desks. Each table needs 3 hours of carpentry, 1 hour of sanding, and 2 hours of staining, with a profit of \$12.50. A chair needs 2 hours of carpentry, 4 hours of sanding, and 1 hour of staining, with a profit of \$20. Desks need 1 hour of carpentry, 2 hours of sanding, and 3 hours of staining, with a profit of \$16.  There are 660 hours of carpentry, 740 hours of sanding, and

853 hours of staining available each week.  The manager would like to make as much money as he can.

1. a) Construct the Linear Programming problem, including an Objective Function and ALL constraints b) Build a fully labeled Initial Simplex Tablea Indicate where and why you will pivot.
2. c) Pivot until you reach an Optimal Solution, and show the final Tableau. You may skip showing any intermediate Tableaux
3. d) State your solution in terms of the word problem above

1. Simplex Method and Duality.
2. a) Put the problem into “standard” Minimum form
3. b) Convert the problem into Dual Form
4. c) Build the Initial Simplex Tableau, indicate where/why you will Pivo Perform ONE Pivot only. d) Answer each question: (i) is the current solution Feasible? (ii) is the current solution Optimal?

Minimize : 14x   9 y  subject  to x    y   120

4x    y    260

2x   5 y    600

x   0 , y    0

1. A Linear Programming problem and its Optimal Tableau are given below:

20pts

 x     y    z       u       v    w    M 0    1    0     5 / 2   1    1     0 0     1   1       1       0     1    0 1    3    0      1 / 2   0    1     0 2 4 13 0    2    0    1 / 2     0    1     1 47

Maximize : z    3x   5 y   2z   s.t.

2x   4 y   2z    34

3x   6 y   4z   57

2x   5 y   z    30

x   0 , y    0 , z    0

1. a) If the RHS of Constraint #1 were to be changed to 30, determine the New Optimal M-value and

the value of each decision variable.  USE sensitivity analysis, NOT by redoing Simplex Method

1. b) If the RHS of Constraint #3 were to be changed to 32, determine the New Optimal M-value and

the value of each decision variable.  USE sensitivity analysis, NOT by redoing Simplex Method

1. c) If the RHS of Constraint #1 were changed to 34 h , find the range of h so that we are still feasibl

1. Business Math students are used in an experiment, where they are sent into a T-shaped maze once each day. If they turn left to exit the maze, they are given a slice of apple pie, while if they turn right to exit the maze, they are given a zap of electricity. It has been observed that the day after they turn left(apple pie!), they will turn left again the next day 55% of the time, and that the day after they turn right, they will turn right again the next day 75% of the time.

1. a) Build and label a transition matrix and initial distribution matrix
2. b) If on the first day, half of the students go each way, what percent will go right the next day?
3. c) USE ALGEBRA to determine the probability of students going each way in the long run. You may check with use of your calculators, but no credit will be given without an algebraic soluti

22.

3 x   2 y   2z   2w      2

2x   2 y   4z   2w    3

x          2z    w    2

x   2 y   6z

2

For the system of linear equations given above, find the value of X in a solution where Y = -2.5

1. A small economy has three industries: coal, steel, and electricity. To produce \$1 of coal, it takes

\$0.04 of coal, \$0.20 of steel, and \$.08 of electricity, while to produce \$1 of steel, it takes \$0.15 of coal and \$0.10 of electricity.  To produce \$1 of electricity, it takes \$0.02 of their own output, plus \$0.30 of coal and \$0.10 of steel.  If the economy needs \$54 million of coal, \$26 of steel, and \$85 of electricity, how much must be produced in the electricity industry, in millions to the nearest tenth?

(Hint: the useful formulas are

X    AX    D

(I    A)  1 D    X   )

I    S (I   R) 1

1. The initial absorbing matrix below has been converted to Standard form. Use

0          0

to determine what percentage of the population starting in Y will eventually end up in Z.

W   X   Y    Z

W   .2    0   .15    0

X   .3    1    .45    0

Y   .4    0   .05    0

Z   .1    0   .35    1

X   Z   W    Y

X   1    0    .3   .45

Z   0    1    .1   .35

W   0    0   .2   .15

Y   0    0   .4   .05

3      2               6

2

1. Given

A     5     4   , C    11     6

and     AB    C , find the total: b2,1   b2,2

1. Build a properly labeled Transition Matrix for the Transition Diagram below:

60%

40%

E              20%         K

80%              25%

30%

P                              Z

100%                       45%

Minimize : 600   5x   7 y  subject  to :

1. 2x 3 y    0

x   4 y  132

x   12

Solve by GRAPHING

1. Find the strictly determined solution of the game matrix below. Show your reasoning.

C

2     0     1

0

3    4

3     2   0

1. Player R has \$1, \$10, and \$50 bills, while player C has \$5 and \$20 bills. Each randomly chooses a bill and shows it for each play of the game. The one with the larger bill collects the difference between their bill and that of the other player.

Write the payoff matrix for this game, showing any necessary labels on the matrix.  Decide whether this game is Strictly Determined or not. If it is strictly determined, what is the Value of the game?

1. Below is a payoff matrix for a certain game. Do the requested tasks which follow.

C

15     40      25

25

10

5

45     20

15

1. a) Show that the matrix does NOT have a strictly determined soluti

1. b) Find the expected payout if

R    .2   .4   .4

.5

and    C     0

.5

1. Adjust the Game Matrix below with the smallest possible Integer so that all values are positive.

Construct either Linear Programming Problem which can be used to find the optimal play for each of R and C.  Solve the LP problem.  Find the fraction of the time each player should make their choices, and find the value of the game(in regards to the original matrix form)

C

0      3

R    1    2

1. Adjust the Game Matrix below with the smallest possible Integer so that all values are positive.

Construct either Linear Programming Problem which can be used to find the optimal play for each of R and C.  Solve the LP problem.  Find the fraction of the time each player should make their choices, and find the value of the game(in regards to the original matrix form)

C

2     3     0

1

1   2

0      4     1

Share Question on Social Media

#### Search

Who is online
There are currently 20 users and 93 guests online. Online users
• Original, compitent and reliable

• Contact for Quality Work

• I am a highly decorated tutor who settles for nothing but the best .

• PROFESSIONAL ACCOUNTING TUTOR&PRACTITIONER

• Best dev Alive...

Find us on Social Media