NAG Toolbox

H – Operations Research

• H Introduction
• h02bb – Integer LP problem (dense)
• nag_mip_ilp_dense – h02bb
• h02bv – Print IP or LP solutions with user-specified names for rows and columns
• nag_mip_ilp_print – h02bv
• h02bz – Integer programming solution, supplies further information on solution obtained by h02bb
• nag_mip_ilp_info – h02bz
• h02cb – Integer QP problem (dense)
• nag_mip_iqp_dense – h02cb
• h02cd – Supply optional parameter values to h02cb
• nag_mip_iqp_dense_optstr – h02cd
• h02ce – Integer LP or QP problem (sparse), using e04nk
• nag_mip_iqp_sparse – h02ce
• h02cg – Supply optional parameter values to h02ce
• nag_mip_iqp_sparse_optstr – h02cg
• h03ab – Transportation problem, modified "stepping stone" method
• nag_mip_transportation – h03ab
• h03ad – Shortest path problem, Dijkstra's algorithm
• nag_mip_shortestpath – h03ad

G13

M01