Math 16: Linear Programming Spring, 2003
Dartmouth College
Instructor: David Little
Lecture: MWF 1:45-2:50, Bradley 103
X-period: Th 1:00-1:50, Bradley 103
 Office: Bradley 411
Office Hours: MWF 10:00-11:30
Phone: (603) 646-2960
E-mail:david.little@dartmouth.edu


General Info/
Announcements
  • 5/29/03 - Homework 8 Solutions
  • 5/28/03 - The final exam is scheduled for Sunday, June 1 from 4:00 - 6:00pm in Bradley 103.
  • 5/23/03 - Homework 7 Solutions
  • 5/19/03 - Midterm Exam II Solutions
  • 5/12/03 - We will meet this Thursday during our x-period in lieu of class on Friday.
  • 5/09/03 - Homework 6 Solutions
  • 5/07/03 - Our second midterm will be held Wednesday May 14 from 7:00 to 9:00pm in Bradley 103.
  • 5/02/03 - Homework 5 Solutions
  • 4/28/03 - Midterm Exam I Solutions
  • 4/25/03 - Homework 4 Solutions
  • 4/18/03 - Homework 3 Solutions
  • 4/15/03 - Our first midterm will be held Wednesday April 23 from 7:00 to 9:00pm in Bradley 103.
  • 4/01/03 - Reminder: no class tomorrow. We will make up this class next week during our x-period. No Foolin'!
  • 3/26/03 - Course Syllabus (Revised 3/28/03)
    * The above files require Adobe's Acrobat Reader.

    • Links
  • Linear Programming: Foundations and Extensions
  • Simple Pivoting Tool
  • Advanced Pivoting Tool
  • Klee-Minty Problems

    • Homework
    Due Date Date Assigned Chapter Topics Covered Homework*
    3/28 Wed. 3/26 - Operations Research And Linear Programming Read Sections 1.1, 1.2, 2.1, 2.2
    4/4 Fri. 3/28 1,2 Linear Programs and The Simplex Method Finish reading Chapter 2
    Problems: 1.1, 1.2, 2.3, 2.4
    Mon. 3/31 2 Simplex Tableau and Pivoting Tool Read 3.1-3.3
    Problems: 2.1, 2.2
    4/11 Fri. 4/4 2 Simplex Method - Phase I (Initialization) Problems: 2.3, 2.4, 2.6, 2.7
    Mon. 4/7 3 Degeneracy and the Lexicographic Method Read 3.4-3.6
    Problems: 3.1, 3.6
    4/18 Wed. 4/9 3 Lexicographic Method and Bland's Rule Read Chapter 4
    Problems: 3.2, 3.4, 3.7
    Thurs. 4/10 3 Fundamental Theorem and Pivoting Tool
    Fri. 4/11 4 Analysis of Simplex Method Read 5.1-5.4
    Problems: 4.2, 4.3
    Mon. 4/14 5 The Dual Problem Read 5.4-5.7
    Problems: 5.1
    4/25 Wed. 4/16 5 Weak And Strong Duality Theorems Problems: 5.3, 5.5, 5.6
    Fri. 4/18 5 Complementary Slackness, Dual-Primal Simplex Method Finish Reading Chapter 5
    Problems: 5.8, 5.9
    Mon. 4/21 5 The General Dual Problem/ Review of Linear Algebra Read 6.1-6.3
    5/2 Wed. 4/23 6 Review of Linear Algebra, continued
    Fri. 4/25 6 The Simplex Method in Matrix Notation Read 8.1-8.5
    Problems: 6.1, 6.2
    Mon. 4/28 8 Implementation Issues Read Chapter 7
    Problems: 8.1a,b,c
    5/9 Wed. 4/30 7 Sensitivity Issues and Parametric Self-Dual Method Read Chapter 9
    Problems: 7.1, 7.2, 7.3, 7.8
    Fri. 5/2 9 A More General Class of Linear Programs Read Chapter 11
    Problems: Click Here
    Mon. 5/5 11 Matrix Games Read Chapter 12.1-12.4
    Problems: 11.1, 11.2
    5/23 Wed. 5/7 11 Minimax Theorem
    Fri. 5/9 12 Linear Regression Read Chapter 13.1-13.3
    Problems: 12.1, 12.2
    Mon. 5/12 13 Network Flows
    Wed. 5/14 - Special Guest Lecture: Prof. Ken Baker on
    Modelling Linear Programs Using Spreadsheets    		 Download Excel File
    Mon. 5/19 13 Primal Network Simplex Method Read Chapter 13.4-13.6
    Problems: 13.1, 13.3, 13.4
    -/- Wed. 5/21 13 Primal Network Simplex Method, continued Read Chapter 14
    Problems: 13.2, 13.6
    Thur. 5/22 13 Primal/Dual Network Simplex Method
    Fri. 5/23 14 Applications of Network Flows Read Chapter 22
    Problems: 14.4, 14.6a, 14.7a, 14.8
    Wed. 5/28 22 Integer Programming Problems
    * Reading assignments should be completed by the next class period.