An Overview of RANDMOD©
RANDMOD is designed to enable random variations in a resident LP, whose matrix file was previously generated, such as by MODLER or GAMS, or was read a library, such as NETLIB. The purpose in doing so is to test either the performance of an algorithm or a response to the model's sensitivity to variations. The following figure represents a job flow for statistical analysis, putting the function of RANDMOD into perspective. (The "base matrix" is from the modeling language or the library.) ![[Graphic]](http://carbon.cudenver.edu/~hgreenbe/imps/randmod.gif)
The experiment can repeat entrances into RANDMOD with the base matrix (or the last matrix) to generate new random variations. Each matrix file is an instance, or random realization, of the base matrix. The optimizer solves each one for some specified number of cases, or with a dynamic stopping rule, such as use of sequential analysis.
Here are some references:
- A Primer for RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program, 1995. Technical Report, Mathematics Department, University of Colorado at Denver, Denver, CO.
Here is a Table of Contents. - RANDMOD: A System for Modifications to an Instance of a Linear Program, ORSA Journal on Computing 3:2 (1991) 173-175.
Last updated: November 29, 1998