PrevNext Top

Math 407 Summer 2006 Class Web Page
LINEAR OPTIMIZATION

Instructor
Name Brad Bell
Office Location Room 471 of Henderson Hall
Office Phone 206-543-6855
Paging 206-543-1300
E-mail m407su06 at washington dot edu
Office Hours Tuesday 11:20-11:50 in Sav 316 and Thursday 8:30-9:30 in Hnd 471

News
The final example solutions and final grades have been posted. You can pick up a copy of your final exam at the Math Student Services office C36 Padelford Hall (phone number 543-6830).

2005 Web Site
Math407 Summer 2005

Discussion List
I have created the following E-Post discussion list for this class: discussion list

MathML Site
If the text π appears as  \pi instead of the corresponding Greek letter, you are viewing home.htm . If your browser supports XHTML + MathML, you will get a better view of these and other pages in this site by starting with home.xml (see viewing MathML below). Printable versions of this web site can be found in the files _printable.htm and _printable.xml .

Viewing MathML
In order to view the *.xml version of this web site, your browser must support MathML . If you use Firefox , MathML is built into the browser but you have to install extra fonts . If you use Microsoft's internet explorer, you will have to instal the MathPlayer plug in to view MathML files.

Class Time and Location
Class meets from 9:40 to 11:20, in Room 316 of Savery Hall (SAV) on the following days:
Tuesday 06/20 06/27 07/11 07/18 07/25 08/01 08/08 08/15
Thursday 06/22 06/29 07/06 07/13 07/20 07/27 08/03 08/10 08/17

Text Book
Author Chvatal, Vasek
Title Linear programming
Pub info New York : W.H. Freeman, c1983

Home Work
There is no graded home work for this class. The instructor will suggest that the students read certain sections of the text book and work some of the corresponding problems.

Computer Solution
You can determine the solution of many of the problems in the text using the Neos interface to Clp. . The Coin-or Linear Programming solver Clp is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. We will use the Neos interface to this executable.

Testing

Quizzes
Quizzes will be returned during class with in one week of the time they are taken. There will be 8 quizzes each 30 minutes long at the end of class on
06/22 06/29 07/06 07/13 07/20 07/27 08/03 08/10
Only the 6 highest quizzes will count for a total possible 6 * 40 = 240 points.

Final
The final will be during the entire last day of class (08/17) and will be worth 160 points; i.e, same weight as four quizzes.

Test Rules
You may use the text book, a printed version of the class web pages, any notes you have written, and a calculator (as an aid in doing arithmetic). That is all you may use; for example, you may not use the internet during tests.

Missing Tests
Makeups for tests must be arranged with the instructor ahead of time. If a student misses a test with out arranging a makeup ahead of time, a score of zero will be assigned for that test. If this only happens for one or two quizzes, they becomes the quizzes that do not count. If this happens for the final, and the student had an emergency that, in the instructors opinion, prevented the student from taking the final, she or he will receive an incomplete (instead of a zero for the final).

Grading Corrections
If a student thinks that the grading of a particular question is not correct, she or he may submit, in writing, an explanation for why they think the grading is not correct and what they think would be correct.

Final Grade
There 400 possible total points, 6 * 40 for quizzes and 4 * 40 for the final. The final grade will be determined by the total number of points divided by 100.

Contents
Table of Contents
Introduction
How the Simplex Method Works
Linear Programming Software
Pitfalls and How to Avoid Them
The Duality Theorem
Selected Applications
Tests and Results
Bibliography
Alphabetic Listing of Cross Reference Tags
Keyword Index
Search This Web Site