110 likes | 274 Views
Introduction to Optimization Neil Tang 2/23/2009. Outline. Optimization Problems Mathematical Programming LP ILP CP. Optimization Problems. An optimization problem is composed of an objective function and a set of constraints.
E N D
Introduction to OptimizationNeil Tang2/23/2009 CS541 Advanced Networking
Outline • Optimization Problems • Mathematical Programming • LP • ILP • CP CS541 Advanced Networking
Optimization Problems • An optimization problem is composed of an objective function and a set of constraints. • Optimization problems in a graph can be solved by algorithms in graph theory. • If an optimization problem can be formulated as a Linear Programming (LP) problem, an Integer Linear Programming (ILP) problem, a Mixed Integer Linear Programming (MILP) problem or a Convex Programming (CP) problem, then the existing algorithms can be applied to solve it. CS541 Advanced Networking
Mathematical Programming CS541 Advanced Networking
LP LP in the standard form CS541 Advanced Networking
Maximum Flow Problem - LP CS541 Advanced Networking
Multi-Commodity Flow Problem - LP CS541 Advanced Networking
Shortest Path Problem - ILP CS541 Advanced Networking
Constrained Shortest Path Problem - ILP CS541 Advanced Networking
CP CP in the standard form Property: if a local minimum exists, then it is a global minimum. CS541 Advanced Networking
Rate Allocation Problem - CP CS541 Advanced Networking