|Welcome||About ...||How to join||Copyright||Calendar||Techies||News|
A short outline of the concept "module" and the modules to be developed in this project. You should read this page if you want to participate in this project.
An interactive computing facility for elementary row operations, including pivoting. it provides training for the simplex method.
A simple animation of movement of bodies subject to gravitational forces. Can be used to illustrate functions of several variables and related topics in optimization theory.
|Die Hard at the Pub:|
An animated dynamic programming treatment of the famous Die Hard at the Pub problem.
A facility that formulates the dual of a linear programming problem. Useful in studying the relationship between the primal and dual linear programming problems.
An animation of the famous N-Queens combinatorial optimization problem. The Flag Example of constraint programming.
|8 Easy Pieces|
An animation of the famous 8 Easy Pieces Game. Good example to illustrate various implicit enumeration methods for discrete optimization problems.
An interactive computing facility to solve systems of linear equations. A useful training tool for the simplex method.
An interactive computing facility to invert matrices. A useful training tool for the simplex method.
|The Simplex Place:|
An interactive computing facility for the simplex method. A useful training tool for the simplex method.
|Towers of Hanoi Puzzle:|
An interactive animation facility for this famous puzzle. A useful training tool for the dynamic programming solution for this problem.
|Shortest Path Problem:|
An interactive computational facility for the classical shortest path problem.
An interactive computational facility for Dijkstra's Algorithm for the shortest path problems (where cycles are allowed, but distances must be nono-negative)
Interactive computational facilities (branch and bound and dynamic programming) for various versions of the classical knapsack problem.