Next: Matrix Formulation of
Up: COMPUTATIONAL SCIENCE SIMULATION
Previous: Linear Programming
- Set of
satisfying constraints are convex region.
- Convex says that if
and 
in a region,
in region.
- Extreme point of convex region is one where
where 
.
- One can show that the optimal solution (if it exists) is an extreme
point of the convex region.
Geoffrey Fox, Northeast Parallel Architectures Center at Syracuse University, gcf@npac.syr.edu