| Routine Name |
Mark of Introduction |
Purpose |
| H02BBF
Example Text Example Data |
14 | Integer LP problem (dense) |
| H02BFF
Example Text Example Data |
16 | Interpret MPSX data file defining IP or LP problem, optimize and print solution |
| H02BUF
Example Text Example Data |
16 | Convert MPSX data file defining IP or LP problem to format required by H02BBF or E04MFF/E04MFA |
| H02BVF | 16 | Print IP or LP solutions with user specified names for rows and columns |
| H02BZF
Example Text Example Data |
15 | Integer programming solution, supplies further information on solution obtained by H02BBF |
| H02CBF
Example Text Example Data |
19 | Integer QP problem (dense) |
| H02CCF
Example Text Example Data |
19 | Read optional parameter values for H02CBF from external file |
| H02CDF | 19 | Supply optional parameter values to H02CBF |
| H02CEF
Example Text Example Data |
19 | Integer LP or QP problem (sparse), using E04NKF/E04NKA |
| H02CFF
Example Text Example Data |
19 | Read optional parameter values for H02CEF from external file |
| H02CGF | 19 | Supply optional parameter values to H02CEF |
| H03ABF
Example Text Example Data |
4 | Transportation problem, modified ‘stepping stone’ method |
| H03ADF
Example Text Example Data |
18 | Shortest path problem, Dijkstra's algorithm |