21-257 SCHEDULE
| Day | Date | Topic | Sections | Homework Problems | Due |
|---|---|---|---|---|---|
| 01/11 | Types of Problems in Operations Research | 1.2 | |
|
|
| We | 01/13 | Sample Problems | 1.3 | 4,10 | 01/21 |
| Fr | 01/15 | Graphical Solutions of Linear Programs | 1.4 | 4,7,10 | 01/21 |
| Mo | 01/18 | Martin Luther King's Day (NO LECTURE) | |
|
|
| We | 01/20 | Linear Span and Linear Independence | 2.3 2.5 |
2 6,8 |
01/28 |
| Fr | 01/22 | Systems of Linear Equations | 2.6 | 8,19 | 01/28 |
| Mo | 01/25 | Review | |
|
|
| We | 01/27 | Review | |
|
|
| Fr | 01/29 | Review | |
|
|
| Mo | 02/01 | Linear Programming - Preview | 3.1 | |
|
| We | 02/03 | Test 1 | |
|
|
| Fr | 02/05 | Slack Variables | 3.2 | 1,2,3,4,5 | 02/11 |
| Mo | 02/08 | Slack Variables | 3.2 | 7 | 02/18 |
| We | 02/10 | The Simplex Algorithm | 3.3 | 1,4 | 02/18 |
| Fr | 02/12 | The Simplex Algorithm | 3.3 | 6,11 | 02/18 |
| Mo | 02/15 | Basic Feasible Solutions and Extreme Points | 3.4 | 2,5 | 02/25 |
| We | 02/17 | Basic Feasible Solutions and Extreme Points | 3.4 | 7 | 02/25 |
| Fr | 02/19 | Formulation Examples | 3.5 | 4,5 | 02/25 |
| Mo | 02/22 | Formulation Examples | 3.5 | 9,10 | 03/04 |
| We | 02/24 | General Constraints and Variables | 3.6 | 3,4 | 03/04 |
| Fr | 02/26 | General Constraints and Variables | 3.6 | 10 | 03/04 |
| Mo | 03/01 | Midsemester Break (NO CLASSES) | |
|
|
| We | 03/03 | The Dual and Minimizing Problems | 3.7 | 2,3,4 | 03/11 |
| Fr | 03/05 | The Dual and Minimizing Problems | 3.7 | 7,9 | 03/11 |
| Mo | 03/08 | Sensitivity Analysis | 3.8 | 1,2,4,6,8 | 03/18 |
| We | 03/10 | Review | |
|
|
| Fr | 03/12 | Review | |
|
|
| Mo | 03/15 | Review | |
|
|
| We | 03/17 | Test 2 | |
|
|
| Fr | 03/19 | Network Models - Introduction | 4.1 | 1,2,5,6,7 | 04/01 |
| Mo | 03/22 | |
|
|
|
| We | 03/24 | Spring Break (NO CLASSES) | |
|
|
| Fr | 03/26 | |
|
|
|
| Mo | 03/29 | The Transportation Problem | 4.2 | 2,4 | 04/08 |
| We | 03/31 | The Critical Path Method | 4.3 | 4,7,9 | 04/08 |
| Fr | 04/02 | Integer Programming - Preview | 7.1 | |
|
| Mo | 04/05 | The Knapsack Problem | 7.2 | 1,2,3 | 04/15 |
| We | 04/07 | Basic Integer Programming Models | 7.6 | 2 | 04/15 |
| Fr | 04/09 | The Traveling Salesman Problem | 7.7 | 5 | 04/15 |
| Mo | 04/12 | Review | |
|
|
| We | 04/14 | Review | |
|
|
| Fr | 04/16 | Spring Carnival (NO CLASSES) | |
|
|
| Mo | 04/19 | Review | |
|
|
| We | 04/21 | Test 3 | |
|
|
| Fr | 04/23 | Recursion | 8.1 | |
|
| Mo | 04/26 | Longest Path | 8.2 | |
|
| We | 04/28 | Fixed Cost Transportation Problem | 8.3 | |
|
| Fr | 04/30 | Dynamic Programming - More Examples | 8.4 | |
|
Send me mail: bd24+@andrew.cmu.edu