## Lecture notes with most views in convex optimization

# Subset of Vertices - Combinatorial Optimization - Homework

Main points of this homework are: Subset of Vertices, Minimum Edge Cover, Size of Maximum Matching, Complementary Slackness, Max-Flow–Min-Cut Theorem, Minimum Cut Separating, Dual Linear Program, Capacity Function, Feasible Point

# Maximum Weight Matching - Combinatorial Optimization - Homework

Main points of this homework are: Maximum Weight Matching, Complete Bipartite Graph, Adjacency Matrix, Dual Algorithm, Bottleneck Matching Problem, Perfect Matching, Polynomial Time Algorithm, Bin Packing Problem, Bin Capacity

# Simplex Method - Combinatorial Optimization - Homework

Main points of this homework are: Simplex Method, Maximum Vertical Distance, Form of Pairs, Measurements of Variable, Simplex Algorithm, Simplex Algorithm, Feasible Point, Positive Distance, Maximum Flow Problem, Directed Graph