| Chapter Introduction | |
| H02BBF | Integer LP problem (dense) |
| H02BFF | Interpret MPSX data file defining IP or LP problem, optimize and print solution |
| H02BUF | Convert MPSX data file defining IP or LP problem to format required by H02BBF or E04MFF |
| H02BVF | Print IP or LP solutions with user specified names for rows and columns |
| H02BZF | Integer programming solution, supplies further information on solution obtained by H02BBF |
| H03ABF | Transportation problem, modified `stepping stone' method |
| H03ADF | Shortest path problem, Dijkstra's algorithm |