•  Syllabus (.pdf file)

Maple files:

1. Unconstrained optimization
2. Constrained optimization
3. Numerical methods for solving optimization problems
4. Simplex method
5. Two-Person Zero-Sum Game
6. Growth models and Phase Plane Analysis I
7. A Competition model. Phase Plane Analysis II. Stability
8. A Compartment Problem

Homework:

1. Homework 1 (due  09/16/03): 4,5 p. 18, 5,6 p.56
2. Homework 2 (requires Maple, due 09/19/03)
3. Homework 3: Solve any two problems from the handout by first formulating the linear program and then using Maple simplex package to solve it (due 10/07/03)

Presentations:

1. Optimization. Below is the list of problems. Please email to me which problems you have been assigned. Due 09/30/03.

•         Scheduling problem
•         The cutting stock problem
•         Traveling Salesman problem
•         Complexity classes P and NP
•         Simulated annealing and Metropolis algorithm
•         Bin packing problem
•         Dynamic Programming
•         The Stagecoach Problem