Teaching Note—Animated Demonstration of the Uncapacitated Network Simplex Algorithm
Thanasis Baloukas - thanasis@uom.gr
Department of Applied Informatics, University of Macedonia, GR-540 06 Thessaloniki, Greece
Konstantios Paparrizos - paparriz@uom.gr
Department of Applied Informatics, University of Macedonia, GR-540 06 Thessaloniki, Greece
Angelo Sifaleras - sifalera@uom.gr
Department of Technology Management, University of Macedonia, GR-592 00 Naousa, Greece
Abstract
Operations Research (OR) instructors use visualizations to help teach graph algorithms and data structures. Algorithm visualization is an illustration of abstract concepts included in computer algorithms, making use of either static or dynamic (animated) computer graphics. In this paper we present new software that includes an animated demonstration of the uncapacitated primal network simplex algorithm. The aim of the animation software is twofold. First, it aims to help OR students understand the algorithm. The algorithm is difficult to grasp for many students because it generates a sequence of rooted trees.
Second, it aims to enable OR instructors to explain each iteration of the algorithm visually with minimal effort. The software can be used in combinatorial optimization, graph theory, and similar courses. The software has been implemented as a Java applet, is freely available and highly interactive, and can be accessed through the Web. The software shows the solution process through textual information and depicts the relevant steps in pseudo code using multiple views.
Key words
OR education; combinatorial optimization; educational software
History
Received: April 2008; accepted: September 2008.
Download the PDF
Citation Information
Baloukas, T., K. Paparrizos, A. Sifaleras. 2009. Teaching Note: Animated demonstration of the uncapacitated network simplex algorithm. INFORMS Trans. Ed. 10(1) 34-40. Available online at http://ite.pubs.informs.org/.
DOI: 10.1287/ited.1090.0026
