Dr. Earl R. Barnes School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0455
This talk will contrast interior point methods for linear programming with the simplex algorithm and show some advantages for interior point methods. We will also show some unexpected behavior for interior point methods. These methods are nonlinear approaches to linear problems. Accordingly, they can exhibit some of the complicated behavior associated with nonlinear dynamical systems. We will show examples of bifurcating solutions, chaos, and fractal patterns generated by these methods.
Go back to AARMS Menu