Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Explores finding the initial Basic Feasible Solution (BFS) in a linear program.
Explores modeling classic optimization problems as mixed integer linear problems, focusing on the knapsack problem and its applications.
Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.
Explores linear programming basics, including basic solutions, feasible solutions, optimal solutions, and challenges in solving integer programming problems.
