- Find the future value. Use the "finance" program.
- List the requirements for a linear programming problem to be in standard form.
- 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.
- Find the payment of a present value problem. Use the "finance" program.
- Find the mean, median, and sample standard deviation for a set of data.
- Solve the matrix equation for X. Two parts.
- Solve a 3x3 system of linear equations. Either use Gauss-Jordan elimination (pivoting) or use the inverse of a matrix.
- 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.
- The initial tableau from a non-standard maximization problem is given. Write the maximization problem.
- Given P(A), P(B) and one more probability, complete a probability distribution and then find several probabilities from the probability distribution.
- Leontief input output problem. Use the "leontief" program.
- Solve a game matrix, giving the optimal row and column strategies, and the value of the game. Use the "game" program.
- 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.
- Markov chain problem. Write the initial state matrix, the transition matrix. Find the first state matrix, and the steady state matrix.
- Binomial probabilities. Use the "binom" program.
- Decision Theory. Most of the payoff table is given, but you need to find a couple of the numbers. Find 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. Also randomly select a bag and draw a coin from it and find some probabilities.
- 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.
- Modified poker hand. Find five poker probabilities when certain cards are thrown out. Use the "hypergeo" program.
- 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.
- Create a payoff table for a game. Then create a probability distribution and 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 test is open notebook. Make sure that your notes are complete in the sections covered on the exam.
- Problems 1-15 are to be worked individually. Problems 16-21 may be worked in a group of up to three people. You must turn in problems 1-15 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.
- There are more than 200 points possible on the exam, so don't be concerned if you can't work every problem.

# | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |

Pts | 6 | 6 | 9 | 6 | 12 | 6 | 6 | 9 | 6 | 18 | |

11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | Total |

9 | 6 | 7 | 12 | 9 | 16 | 21 | 9 | 15 | 11 | 9 | 208 |