# 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
- LP Solution
- LP Dual
- Network(Max) Flows
- Shortest Path
- Project Management Graph

- Handouts
- Resources
- Simplex Algorithm Explanation (How to Solve a Linear Program)
- Solving a Standard Maximization Problem using the Simplex Method by Scott Elliott
- 🐂🍺 Awesome Videos by Shokoufeh Mirzaei at Cal Poly Pomona
- Definition of basic and nonbasic variables in simplex method
- Special Cases of Linear Programming Problem
- How to Solve a Linear Programming Problem Using the Big M Method
- Dual Programming

- Max Flow: The transportation problem
- CPM: Project Management Networks