Methods - Operations Research Models and Methods

Methods

Network Flow Programming

Minimal Shortest Path/Shortest Path Tree

Transportation Simplex Demo

Teach Transportation Add-in

Network Primal Simplex

Teach Network Add-in


Network Flow

	Network Flow Programming
	There are a number of demonstrations and two add-ins involving the optimization methods for network flow programming. Some of them include Flash movies. To view them you need to download a free Flash Player from Macromedia. (Download Flash Player) Click on the link above to be transferred to the download facility at Macromedia.

Minimal Spanning Tree/Shortest Path Tree

This html document compares greedy algorithms for the minimal spanning tree and shortest path tree algorithms. An included Flash demonstration allows the student to make decisions that determine how the algorithms progress.

Transportation Simplex Demo

The demo implemented with Flash asks the student to determine dual variables and cycles for flow change, so it assumes some familiarity with the method.

Teach Transportation Add-in

The Teach Transportation Excel add-in provides instruction for the tableau implementation of the primal simplex method for the transportation problem. Download the add-in at the Add-in page of this site.

Network Primal Simplex

This page shows the steps taken for the network primal simplex method. It includes a Flash dynamic demonstration. No student interaction is required beyond pressing OK buttons.

Teach Network Add-in

The Teach Network add-in provides instruction for the primal simplex method for network flow programming models. The add-in illustrates the algorithm for both pure and generalized problems. Download the add-in at the Add-in page of this site.