Explores modeling classic optimization problems as mixed integer linear problems, focusing on the knapsack problem and its applications.
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Explores greedy heuristics in optimization, integrality constraints, and comparison of optimization methods.
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
