Discrete Mathematical Modeling
Math 381 Course Notes University of Washington
Prof. Sara Billey Winter Quarter, 2009
c R. J. LeVeque
2
Acknowledgments: These notes are based on many quarters of Math 381 at the University of Washington. They have developed
HOMEWORK 4
(1) BONUS: Model, program in R, and hand in model and solution: Cereal Blending http:/www.math.washington.edu/~burke/crs/407/models/m4.html Detergent Production http:/www.math.washington.edu/~burke/crs/407/models/m10.html (2) For the following
HOMEWORK 3
(1) Dene the following terms: (a) Stochastic process (b) Markov property (c) Stationarity condition (2) Modeling with Markov Chains Payo Insurance Company charges a customer according to his or her accident history. A customer who has had no ac
\documentclass[12pt]cfw_amsart \usepackagecfw_graphicx \usepackagecfw_amsmath \usepackage[left=2cm, top = 2cm, right=2cm, bottom=2cm]cfw_geometry % There seems to be some problem with bbold under PcTex (pdflatex works ok) % \usepackagecfw_bbold \newcomman
HOMEWORK 2 (1) Do problem 3 on page 6 of the course notes (Farmer Janes problem). Model the situation as a linear problem with an objective and constraints. Solve using the lpSolve package in R. Answer part c) - what new information might come to light du
HOMEWORK 1 (1) Write three ideas, one paragraph each, that might be reasonable for the modeling project. This is just an exercise to get you thinking about the project - you are not bound to doing one of these ideas.
(2) Download R. You can start the proc
function [mst, cost] = prim(A) % % % % % % User supplies adjacency matrix A. This program uses Prim's algorithm to find a minimum spanning tree. The edges of the minimum spanning tree are returned in array mst (of size n-1 by 2), and the total cost is ret
MATH 381: DISCRETE MATH MODELING, SUMMER 2010
Time/Location: TTh, 9:40-11:40 More 234 Instructor: Sasha Aravkin (aleksand@math.washington.edu) Oce: Padelford C-114 Oce Hours: Thursday after class, and by appointment. T.A.: Jane Hung (jyenhung@u.washington