INDENG 162 Linear Programming and Network Flow - 2022 Spring

Those are note archives as well as very well-structured final review docs I made for my self. I put it here so that you can study it and also I will be able to review it later. So if you found this useful, make sure you star my repo

INDENG 162 Linear Programming and Network Flows. (Spring 2022)

Absolutely trash course, definitely regreted my time here. Take EECS 127 instead.

Resource List

• Class Resources
  • Handouts
    • LP Formation
      • 1 - Bakery
      • 2 - Investment
      • 3 - Make or Buy
      • 4 - Person Power
      • 5 - Leasing
      • 6 - Investment ABCD
    • LP Solution
      • 7 - Giapetto + AMPL
      • 8 - Graphical
      • 9 - Graphical Sensitivity Analysis
      • 10 - Simplex Algorithm
      • 10 - Additional Sensitivity Analysis
      • 11 - Cases of Simplex Algorithm
    • LP Dual
      • 12 - Duality
      • 13 - Dual of non-standard LP
      • 14 - Primal & Dual Relationships
    • Network(Max) Flows
      • 16 - Intro to Network Flow
      • 17 - Chairs
      • 18 - Transportation
      • 19 - Individuals to Tasks
    • Shortest Path
      • 20 - Maximizing Rent (Intro to Dynamic Programming)
      • 21 - Equipment Replacement
      • 22 - Dijkstra
      • 23 - DP for DAG
      • 24 - Dijkstra Again
    • Project Management Graph
      • 25 - Critical Project Management
      • 26 - LP formation of a CPM problem
• Resources
  • Simplex Algorithm Explanation (How to Solve a Linear Program)
  • Solving a Standard Maximization Problem using the Simplex Method by Scott Elliott
    • Part 1
    • Part 2
  • 🐂🍺 Awesome Videos by Shokoufeh Mirzaei at Cal Poly Pomona
    • Definition of basic and nonbasic variables in simplex method
    • Special Cases of Linear Programming Problem
      • Part1:Degeneracy Condition
      • Part 2: Unbounded Solution
      • Part 3: Alternative Solution
    • How to Solve a Linear Programming Problem Using the Big M Method
    • Dual Programming
      • Part 1 Relationship between the Primal and Dual LP
      • Part 2: How to write the dual programming of a linear programming problem
      • Part 3: Writing the Dual Programming of a Linear Programming Problem
  • Max Flow: The transportation problem
  • CPM: Project Management Networks