Math 160: Study Guide - Final Exam
- Compound interest problem. Use the "finance" program.
- Present value problem. Use the "finance" program.
- Retirement problem. Figure out what the need to retire and what it will take each month to save that. Figure out how
long the retirement will last if extra is paid. Find the remaining balance after a certain period of time. Use the "finance"
- Matrix multiplication problem. Find the product of two matrices, interpret the product by labeling the rows and
columns. Look at the boat problem out of section 4.4.
- Solve a 3x3 system of linear equations. Either use Gauss-Jordan elimination (pivoting) or use the inverse of a matrix.
- Solve the matrix equation for X. Two parts.
- Leontief input output problem. Use the "leontief" program.
- List the requirements for a linear programming problem to be in standard form.
- The initial tableau from a non-standard maximization problem is given. Write the maximization problem.
- Maximize a standard linear programming problem. Write the initial tableau and final tableau, and give the values of the
objective function and decision variables. Use the "simplex" program.
- Given P(A), P(B) and one more probability, complete a probability distribution and then find several probabilities from
the probability distribution.
- Find probabilities. Part of it can be done using the hypergeometric distribution, but you will also need to use the
multiplication rule for independent events.
- Find the mean, median, and sample standard deviation for a set of data.
- Binomial probabilities. Use the "binom" program.
- Solve a game matrix, giving the optimal row and column strategies, and the value of the game. Use the "game"
- Markov chain problem. Write the initial state matrix, the transition matrix. Find the first state matrix, and the steady
- Linear programming problem. A tableau is given. Label the columns as appropriate using x's for the decision variables,
s's for the slack variables, z for the objective function, and rhs for the right hand side. Identify the value of the
variables. Choose a possible objective function (multiple choice). Identify which variables are basic and which are non-basic. Circle the pivot element. Identify which variable is entering and which is exiting.
- Decision Theory. Most of the payoff table has been created for you, but you need to find two entries in the table. Create
the opportunistic loss table. Then give the value and optimal action under each criteria.
- Probability problem. Two bags with different types of coins in them. Draw a coin out of bag 1 and place it into bag 2
and then find some probabilities.
- The payoffs for a game are given. Find the probabilities of each payoff and then find the expected value. Identify
whether the game is fair or not. You may use the "pdist" program, although it's probably easier to do by hand.
- The final tableau from a zero-sum, two-player game is given. Give the optimal row and column strategies and the value
of the game.
- Absorbing Markov chain problem. Write the initial state matrix and the transition matrix. Then find the expected
number of transient states before leaving the matrix.
- The test is open notebook. Make sure that your notes are complete in the sections covered on the exam.
- Problems 1-16 are to be worked individually. Problems 17-22 may be worked in a group of up to three people. You
must turn in problems 1-16 before getting into a group.
- After approximately one hour, you will be able to get into groups of up to three people. However, when you get into
groups, you will lose your notebooks. For this reason, get as much of the information transferred from your notes onto
your test as necessary before you get into groups.
- You do not have to get into groups when permission is granted. You may continue to work alone with your notes until
you're ready to get into groups.
- The exam is laid out in chapter order. Having your notes in order will help.
- The individual part of the exam is 125 points, the group part is 75 points.
Point break down by problem
Point break down by chapter