21-257 Syllabus
Fall 1999


All reading assignments are from Introduction to Mathematical Programming by Russell C. Walker, Prentice Hall, 1999, unless otherwise noted.

Monday Wednesday Thursday Friday
August 23

Topic: Course Admin. and Overview of Mathematical Programming
Reading Assignment: Sec. 1.1 and 1.2
August 25

Topic: Sample Problems & Graphical Solution
Reading Assignment: Sec. 1.3 and 1.4
August 26

Topic: More Graphical Solutions
August 27

Topic: Linear Algebra Review
Reading Assignment: Chapter 2
August 30

Topic: Slack Variables
Reading Assignment: Sec. 3.1 and 3.2
Homework 1 is due.
September 1

Topic: Simplex Algorithm
Reading Assignment: Sec. 3.3
September 2

Topic: Questions from Homework 1 and
More on Simplex Algorithm
September 3

Topic: Does the Simplex Algorithm always work?
Reading Assignment: Sec. 3.4
September 6
Labor Day
No Classes
September 8

Topic: Applications
Reading Assignment: Sec. 3.5
Homework 2 is due.
September 9

Topic: Questions from Homework 2 and
More Applications
September 10

Topic: Applications
September 13

Topic: LINDO and General Constraints and Variables
Reading Assignment: Appendix A.1 and Sec. 3.6
LINDO Examples from lecture
LINDO Homepage
September 15

Topic: More on General Constraints and Variables
Reading Assignment: Sec. 3.6
Homework 3 is due.
September 16

Topic: Questions from Homework 3 and
Examples of Simplex Algorithm applied to a general LP
September 17

Topic: The Dual and Minimization
Reading Assignment: Sec. 3.7
September 20

Topic: More on the Dual and Minimization
Reading Assignment: Sec. 3.7
Homework 4 is due on Tuesday, September 21, 1999.
September 22

Topic: Sensitivity Analysis
Reading Assignment: Sec. 3.8
September 23

Topic: Questions from Homework 4 and
Examples of Dual, Minimization and Sensitivity Analysis
September 24

Topic: More Sensitivity Analysis
Reading Assignment: Sec. 3.8
September 27

Topic: Sensitivity Analysis and Applications
Homework 5 is due.
September 29

Topic: Applications and Review for Exam
September 30

Topic: Questions from Homework 5 and Review for Exam
October 1

Exam 1
Exam Information
October 4

Topic: Intro. to Integer Programming and Network Problems
Reading Assignment: Section 4.1
No Homework is Due today!
October 6

Topic: The Transportation Problem
Reading Assignment: Sec 4.2
Graded Exams Returned.
October 7

Topic: Exam Solutions and Transportation Examples
October 8

Topic: Transportation Problem
Reading Assignment: Section 4.2
October 11

Mid-Semester Break
No Classes
October 13

Topic: Forestry Trucking Example
Reading Assignment: Sec 4.3 and the Interfaces article from Homework 7.
Homework 6 is due.
October 14

Topic: Questions from Homework 6
October 15

Topic: Critical Path Method
Reading Assignment: Sec. 4.3
October 18

Topic: Critical Path Method
Reading Assignment: Sec. 4.3
Homework 7 is due.
October 20

Topic: Critical Path Method
Reading Assignment: Last part of Sec. 4.3 (on budget constraints and time constraints)
October 21

Topic: Questions from Homework 7
October 22

Topic: Integer Programming and the Knapsack Problem
Reading Assignment: Section 7.1 and 7.2
October 25

Topic: Knapsack Problem and The Dual Simplex Algorithm
Reading Assignment: Sec. 7.3
Homework 8 is due.
October 27

Topic: More Sensitivity Analysis
Reading Assignment: Sec. 7.3
October 28

Topic: Questions from Homework 8
October 29

Topic: Adding a Constraint and Branch and Bound Algorithm
Reading Assignment: Sec. 7.4 and Sec 7.5
November 1

Topic: Integer Programming Examples
Reading Assignment: Sec. 7.6
Homework 9 is due.
November 3

Topic: Integer Programming Examples with LINDO and Piecewise linear function examples
Reading Assignment: Sec. 7.6
November 4

Topic: Questions from Homework 9 More integer programming examples
November 5

Topic: Set Covering Problems and the Cut & Trim Problem
Reading Assignment: Sec. 7.6 and Handout
November 8

Topic: The Cut & Trim Problem
Reading Assignment: Handout
Homework 10 is due.

Tuesday, November 9

Optional Consultation with Instructor about Projects. See Project page (Option I, II or III) for details.
November 10

Class cancelled
November 11

Topic: Questions from Homework 10

Optional Consultation with Instructor about Projects. See announcements on the optimization homepage for details.
November 12

Topic: More integer programming examples
Reading Assignment: Sec. 7.6
November 15

Topic: Caterer Example, Review of Transportation Problem and Regulated Telephone Pricing Example
Reading Assignment: Handout and Sec 4.2
Homework 11 is due.
November 17

Topic: Review for Exam
Reading Assignment: Bring questions to class
November 18

Topic: Questions from Homework 11 and review for exam
November 19

Exam 2

Exam Information
Optional Rough Draft of Analysis Section of Project is Due. See Project page (Option I, II or III) for details.
November 22

Topic: The Traveling Salesman Problem
Reading Assignment: Sec. 7.7
No Homework is Due Today!
November 24

Thanksgiving Break
No Classes
November 25
Thanksgiving Break
No Classes
November 26
Thanksgiving Break
No Classes
November 29

Topic: Dynamic Programming approach to the Cargo Problem (a variation of the knapsack problem)
Reading Assignment: First half of Sec. 8.4
Projects (Options I, II and III) are Due.
Homework 12 is due.
December 1

Topic: Dynamic Programming approach to the Fixed-Cost Transportation Problem and a survey of what is beyond this course
References for the examples
Reading Assignment: Sec. 8.3
December 2

Topic: Questions for Homework 12,
Dynamic Programming and
Review for the Final
December 3

Topic: Review and Discussion of the Final
Reading Assignment: Bring questions to class

Graded Projects Returned

Last Day of Classes!
December 6

Final's Week
December 8

Reading Day
December 9

Final Exam
5:30-8:30pm
University Center's McConomy Hall
December 10

Final's Week


Return to Optimization Page.
Last updated December 1, 1999.