Optional videos, Operations Research
Math 339, Spring 2022

What is this?

Daily Information and Links

• Week 1: We really start in 3.1, but there is review HW for Chapter 2 (linear algebra review).
  • Wed
    • What is Operations Research - The Wyndoor Problem (1 of 4)
    • Solve the Wyndoor problem (2 of 4)
    • What is a linear program, and what assumptions do we need to make? (3 of 4). We didn't get this far in class on Wednesday, we'll discuss this on Friday.
    • Vocabulary review (4 of 4). We'll summarize this on Friday in class.
  • Fri
    • Use LibreOffice Calc to solve a linear program
• Week 2: Most of Chapter 3
  • Section 3.3 (Special cases)
  • Section 3.4 (Dietary needs)
  • Section 3.5 (Scheduling, example 1)
  • Section 3.5 (Scheduling, example 2)
  • Section 3.8 (Blending, Chemco Example)
• Week 3: Intro to Chapter 4 (Simplex Method, Convexity, Directions of Unboundedness)
  • Section 4.1: Convert to Standard Form
  • (with Section 4.1) What is a BFS?
  • (with Section 4.2) BFS versus Corner Point
  • (with Section 4.3) Directions of Unboundedness and Convexity
  • (with Section 4.3) Compute a direction of unboundedness
  • (with Section 4.3) How to compute a convex combination
  • (with Section 4.3) How to compute a convex combination (continued)
  • (with Section 4.4) The 3 Theorems in Ch 4
• Week 4: The Simplex Algorithm (4.3-4.7)
  • (with Section 4.5) A first example
  • (with Section 4.5) The example, continued.
• Week 5 (4.8-4.13)
• Week 6 Exam 1 Week (with President's Day)
• Week 7 (6.1-6.4)
• Week 8 (6.5-6.8)
  • OR-001 Section 6.5, What is the Dual? (Google drive video- the remaining are Youtube)
  • (Skip Section 6.6)
  • OR-002 Section 6.7, set up to the theory.
  • OR-003 Section 6.7, the Dual Theorem (and proof)
  • OR-004 Section 6.7, Example
  • OR-005 Comments about the end of 6.7
  • OR-006 Section 6.8, Shadow prices and the Dual
• Week 9 (6.9-6.10)
  • OR-007 Section 6.9 (Duality and Sensitivity)
  • OR-008 Finishing example from 6.9
  • OR-009 A Motivating Example before 6.10
  • OR-010 Section 6.10 (Complementary Slackness, proving Theorem 2)
  • OR-011 Example 1, Section 6.10
  • OR-012 Example 2, Section 6.10
• Week 10 (6.11, 7.1-7.2)
  • OR-013 Motivation for Section 6.11
  • OR-014 Section 6.11 (The Dual Simplex Method) (Typo at 4:15, 2x_3 should be 2x_2).
  • OR-015 An Example using Dual Simplex (6.11)
  • OR-016 Section 7.1, Transportation Problems (Part one)
  • OR-017 Section 7.1, Transportation Problems (Part Two)
  • OR-018 Using Excel to Solve Transportation Tableau (7.1)
  • OR-019 Section 7.2 Loops
  • OR-020 Section 7.2 Theory of BFS
  • OR-021 Section 7.2 Three Methods to Find an Initial BFS
• Week 11 (7.3-7.5)
  • OR-022 Section 7.3, Part 1
  • OR-023 Section 7.3, Part 2
  • OR-024 Section 7.4, Sensitivity Analysis
  • OR-025 Section 7.5 The Assignment Problem
  • OR-026 Section 7.5 - Zeros and Extensions
• Week 12 (7.6, Exam 2)
  • OR-027 Transhipment, Part 1.
  • OR-028 Transhipment, Part 2.
  • Spreadsheet referred to in the notes.
  • Wed- Review
  • Fri- Exam 2
• Week 13: Networks and Graphs (8.1-8.3).
  • Monday: Sections 8.1-8.2
    • OR-029 Intro to Graphs, Examples Part 1
    • OR-030A Section 8.1 Example of Bookshelf
    • OR-030B Section 8.1 Example of Maintenance Agreement
    • Section 8.1 notes (PDF)
    • OR-031 The Shortest Path (Dijkstra's algorithm)
    • Section 8.2 notes (different than the text)
    • Homework: Section 8.2, #2-8. Turn in 2, 4, 8. Due on Thursday.
  • Wed, Fri: Section 8.3: Network Flows
    • OR-032 Section 8.3 Network Flows (Youtube)
    • OR-033 Section 8.3 Part 2
    • OR-034 Section 8.3, Example 1
    • OR-035 Section 8.3, Example 2
    • Notes for Section 8.3 (PDF)
    • Homework- Section 8.3: 4, 5, 7, 8, 9. Turn in 8, 9. Due on Friday.
  • Fri, Mon: Section 8.4: Project Management
    • OR-036 Section 8.4 part 1 (new Spr22)
    • OR-037 Section 8.4 part 2
    • OR-038 Section 8.4 part 3
    • Homework: Work out the critical path (and the 6 table values per node) for the project tables in 8.4: Table 20, 22 and 26.
• Week 14
  • Mon: 8.4 (See last Friday for details)
  • Wed: 8.5:
    • OR-39, MCNFP, part 1
    • OR-40, MCNFP, part 2
    • OR-41, MCNFP, part 3
    • Notes and HW (PDF)
  • Fri: 8.6 (very short)
    • OR-42, Minimum Spanning Tree
    • Notes on 8.6 and HW (PDF)
  • Fri: 8.7: Intro and first example
    • OR-43 Section 8.7, Part 1 of 3
    • OR-44 Section 8.7, Part 2 of 3
    • OR-45 Section 8.7, Part 3 of 3
  • Fri, 8.7: Example 2
    • OR-46: Example 2, Part 1 of 3
    • OR-47: Example 2, Part 2 of 3
    • OR-48: Example 2, Part 3 of 3
  • Fri, 8.7: Homework
    • Homework for 8.7