Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.
Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Covers the proof of strong duality in optimization problems and provides examples of Rayleigh quotient optimization.
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
