H Chapter Contents (PDF version)
H Chapter Introduction
NAG Library Manual

NAG Library Chapter Contents

H – Operations Research

H Chapter Introduction

Routine
Name
Mark of
Introduction

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

H Chapter Contents (PDF version)
H Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2011