h Chapter Introduction – a description of the Chapter and an overview of the algorithms available
| Function Name |
Mark of Introduction |
Purpose |
| h02bbc
Example Text Example Data |
5 | nag_ip_bb Solves integer programming problems using a branch and bound method |
| h02buc
Example Text Example Options |
5 | nag_ip_mps_read Read MPSX data for IP, LP or QP problem from a file |
| h02bvc | 5 | nag_ip_mps_free Free memory allocated by nag_ip_mps_read (h02buc) |
| h02dac
Example Text |
25 | nag_mip_sqp Mixed integer nonlinear programming |
| h02xxc | 5 | nag_ip_init Initialize option structure to null values |
| h02xyc | 5 | nag_ip_read Read optional parameter values from a file |
| h02xzc | 5 | nag_ip_free Free NAG allocated memory from option structures |
| h02zkc | 25 | nag_mip_opt_set Option setting routine for nag_mip_sqp (h02dac) |
| h02zlc | 25 | nag_mip_opt_get Option getting routine for nag_mip_sqp (h02dac) |
| h03abc
Example Text |
3 | nag_transport Classical transportation algorithm |
| h03bbc
Example Text Example Data |
25 | nag_mip_tsp_simann Travelling Salesman Problem, simulated annealing |
| h05aac
Example Text Example Data |
24 | nag_best_subset_given_size_revcomm Best subsets of size (reverse communication) |
| h05abc
Example Text Example Data |
24 | nag_best_subset_given_size Best subsets of size (direct communication) |