|
|
These are Excel add-in files (.xla) for the Teach OR collection.
They are compressed and stored at this site with the (.zip)
suffix. Download by clicking on the file name of the add-in
in the left most column. The files may be expanded with the
free Aladdin Expander.
Instructions for these add-ins are in the Methods section
of this site.
As the add-ins are improved and corrected, we update the versions
on the web. The Date Modified entries below show
the dates of the latest revisions. Click the Revisions
link on the left to see the purpose of each revision. If you
replace an add-in with a newer version, be sure to delete or
change the name of the old version. Otherwise, Excel may link
to the old version rather than the new.
Links are provided to the instructions for each add-in. Click
on the add-in name or the leaf on the right to reach the instructions.
Add-ins are not used like regular Excel workbook files. They
must be installed through the add-in dialog on the tools menu
or through the Add
Teach add-in. Review the General
Instructions for loading add-ins.
| File Name |
Date Modified |
Add-in Name |
Instructions |
|
| |
|
|
|
|
| |
11/16/04 |
Add
Teach Add-in
When called, this add-in lists all the Teach OR
add-ins that are in the same directory as the Add
Teach add-in. Add-ins are installed and removed
with a simple click of a button. The add-in also loads
demonstration files that illustrate the add-ins. To
use this feature these files must be stored in a the
same directory as the add-ins. See the instructions
for details.
|
|
|
| |
11/16/04 |
Teach
Linear Programming
The add-in teaches three solution algorithms for
linear programming, the Tableau Simplex method, the
Revised Simplex method and the Interior Point method.
|
|
|
| |
11/16/04 |
Teach
Transportation
This add-in is concerned with solving the Transportation
problem with the primal simplex method. The program
works on problems with up to 10 suppliers or demanders.
|
|
|
| |
11/16/04 |
Teach
Network
This add-in considers the primal simplex method for
network flow programming problems. Included are algorithms
for the pure and the generalized minimum cost flow problems.
|
|
|
| |
11/26/04 |
Teach
Integer Programming
Three methods for solving integer programming problems
are shown: branch and bound, Gomory cuts and Benders'
Algorithm.
|
|
|
| |
11/26/04 |
Teach
Nonlinear Programming
This add-in demonstrates procedures used to solve
unconstrained nonlinear programming problems. Two
procedures are available, gradient search and conjugate
gradient search. The convexity of the objective function
at specified points is determined.
|
|
|
| |
11/16/04 |
Teach
Dynamic Programming
The add-in provides a structure for the various model
components for dynamic programming. The student provides
the various components using Excel functions. The optimization
algorithms use recursion and reaching to find optimum
solutions.
|
|
Archive |
| |
11/26/04 |
Jensen
Library
This is the complete collection of ORMM, Teach
OR and OM/IE add-ins. The archive also
includes the the folder demo_xls. This folder
includes all the demonstrations for the add-ins.
|
|
|
|
