Table of Contents
PPT Slide
General Outline
Acknowledge
What ??
Linear Programming (LP)
LP Example
LP Example
Integer Linear Programming
Mixed Integer Linear Programming
Why ??
Optimization
Shortest Path
Shortest Path Applications
Traveling Salesman
Set Covering
Set Packing
Set Partitioning
Knapsack Problem
Matching
Batch Scheduling
P, NP, NP complete
How ??
LP Simplex-Very Simple Overview
MILP Enumeration
Relaxation: Definition
LP Relaxations
Branch and Bound, Minimize, Depth First
Depth First
Best First
Best First
Compromise: Depth First, Best Back
Branch and Bound
Improving Relaxations
Branch and Cut
Where ??
Batch Scheduling
Propositional Logic
Multiple Model Systems
Fault Diagnosis
Control Objective Ordering
Huh ??
|
Author: Doyle Research
Email: gatzke@udel.edu
Home Page: http://udel.edu/~gatzke
|