Library Home || Full Table of Contents || Suggest a Link || Library Help
|Moshe Sniedovich and Angie Byrne|
|An online Operations Research (OR) tutorial system developing tutorial modules for specific OR topics, generic web tools to facilitate the construction of the OR modules, and research of the WWW technologies pertaining to this project. Modules for investigating simplex basics, simplex engine, sensitivity, duality, shortest path, knapsack, travelling spider problem (naive dynamic programming algorithms for the travelling salesman problem), towers of Hanoi, transitivity, counterfeit coin, prince's pub, turtles' duel, CPM (critical path method), n-queens puzzle, 8 easy pieces (3x3 slider puzzle), and Geee Park (program the gravitational acceleration and horizontal and vertical velocities of a skateboarding turtle to jump over a wall). Also, news and FAQs.|
|Math Topics:||Linear Algebra, Matrices, Systems of Linear Equations, Graph Theory, Operations Research, Dynamic Programming, Game Theory, Linear Programming|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.