NAG Library Chapter Introduction

H – Operations Research

This chapter provides routines to solve certain integer programming, transportation and shortest path problems. Additionally ‘best subset’ routines are included.

General linear programming (LP) problems (see Dantzig (1963)) are of the form:

• find $x={\left(x_1,x_2,\dots ,x_n\right)}^{\mathrm{T}}$ to maximize $F\left(x\right)={\displaystyle \sum _{j=1}^n}{c}_j{x}_j$
• subject to linear constraints which may have the forms:

  $$\begin{array}{lll}\sum _{j=1}^n{a}_{ij}{x}_j=b_i\text{,}& i=1,2,\dots ,m_1& \text{(equality)}\\ \sum _{j=1}^n{a}_{ij}{x}_j\le b_i\text{,}& i=m_1+1,\dots ,m_2& \text{(inequality)}\\ \sum _{j=1}^n{a}_{ij}{x}_j\ge b_i\text{,}& i=m_2+1,\dots ,m& \text{(inequality)}\\ x_j\ge l_j\text{,}& j=1,2,\dots ,n& \text{(simple bound)}\\ x_j\le u_j\text{,}& j=1,2,\dots ,n& \text{(simple bound)}\end{array}$$

This chapter deals with integer programming (IP) problems in which some or all the elements of the solution vector $x$ are further constrained to be integers. For general LP problems where $x$ takes only real (i.e., noninteger) values, refer to Chapter E04.

IP problems may or may not have a solution, which may or may not be unique.

Consider for example the following problem: The hatched area in Figure 1 is the feasible region, the region where all the constraints are satisfied, and the points within it which have integer coordinates are circled. The lines of hatching are in fact contours of decreasing values of the objective function $3x_1+2x_2$, and it is clear from Figure 1 that the optimum IP solution is at the point $\left(1,1\right)$. For this problem the solution is unique.

However, there are other possible situations.

(a)	There may be more than one solution; e.g., if the objective function in the above problem were changed to $x_1+x_2$, both $\left(1,1\right)$ and $\left(2,0\right)$ would be IP solutions.
(b)	The feasible region may contain no points with integer coordinates, e.g., if an additional constraint $$3x_1\le 2$$ were added to the above problem.
(c)	There may be no feasible region, e.g., if an additional constraint $$x_1+x_2\le 1$$ were added to the above problem.
(d)	The objective function may have no finite minimum within the feasible region; this means that the feasible region is unbounded in the direction of decreasing values of the objective function, e.g., if the constraints $$4x_1+2x_2\ge 5\text{, \hspace{1em}}{x}_1\ge 0\text{, \hspace{1em}}{x}_2\ge 0\text{,}$$ were deleted from the above problem.

Algorithms for IP problems are usually based on algorithms for general LP problems, together with some procedure for constructing additional constraints which exclude noninteger solutions (see Beale (1977)).

The Branch and Bound (B&B) method is a well-known and widely used technique for solving IP problems (see Beale (1977) or Mitra (1973)). It involves subdividing the optimum solution to the original LP problem into two mutually exclusive sub-problems by branching an integer variable that currently has a fractional optimal value. Each sub-problem can now be solved as an LP problem, using the objective function of the original problem. The process of branching continues until a solution for one of the sub-problems is feasible with respect to the integer problem. In order to prove the optimality of this solution, the rest of the sub-problems in the B&B tree must also be solved. Naturally, if a better integer feasible solution is found for any sub-problem, it should replace the one at hand.

A common method for specifying IP and LP problems in general is the use of the MPSX file format (see IBM (1971)). A full description of this file format is provided in the routine document for H02BUF.

The efficiency in computations is enhanced by discarding inferior sub-problems. These are problems in the B&B search tree whose LP solutions are lower than (in the case of maximization) the best integer solution at hand.

The B&B method may also be applied to convex quadratic programming (QP) problems. Routines have been introduced into this chapter to formally apply the technique to dense general QP problems and to sparse LP or QP problems.

A special type of linear programming problem is the transportation problem in which there are $p\times q$ variables $y_{kl}$ which represent quantities of goods to be transported from each of $p$ sources to each of $q$ destinations.

The problem is to minimize where $c_{kl}$ is the unit cost of transporting from source $k$ to destination $l$. The constraints are: Note that the availabilities must equal the requirements: and if all the $A_k$ and $B_l$ are integers, then so are the optimal $y_{kl}$.

The shortest path problem is that of finding a path of minimum length between two distinct vertices $n_s$ and $n_e$ through a network. Suppose the vertices in the network are labelled by the integers $1,2,\dots ,n$. Let $\left(i,j\right)$ denote an ordered pair of vertices in the network (where $i$ is the origin vertex and $j$ the destination vertex of the arc), $x_{ij}$ the amount of flow in arc $\left(i,j\right)$ and $d_{ij}$ the length of the arc $\left(i,j\right)$. The LP formulation of the problem is thus given as where and The above formulation only yields a meaningful solution if $x_{ij}=0\text{ or }1$; that is, $\mathrm{arc}\left(i,j\right)$ forms part of the shortest route only if $x_{ij}=1$. In fact since the optimal LP solution will (in theory) always yield $x_{ij}=0\text{ or }1$, (1) can also be solved as an IP problem. Note that the problem may also be solved directly (and more efficiently) using a variant of Dijkstra's algorithm (see Ahuja et al. (1993)).

The travelling salesman problem is that of finding a minimum distance route round a given set of cities. The salesperson must visit each city only once before returning to his or her city of origin. It can be formulated as an IP problem in a number of ways. One such formulation is described in Williams (1993). There are currently no routines in the Library for solving such problems.

The best $\mathit{n}$ subsets problem assumes a scoring mechanism and a set of $m$ features. The problem is one of choosing the best $n$ subsets of size $p$. It is addressed by two routines in this chapter. The first of these uses reverse communication; the second direct communication.

H02BBF, H02BFF and H03ABF treat all matrices as dense and hence are not intended for large sparse problems. For solving large sparse LP problems, use E04NQF or E04UGF/E04UGA.

H05AAF selects the best $n$ subsets of size $p$ using a reverse communication branch and bound algorithm.

H05ABF selects the best $n$ subsets of size $p$ using a direct communication branch and bound algorithm.

None.

Ahuja R K, Magnanti T L and Orlin J B (1993) Network Flows: Theory, Algorithms and Applications Prentice–Hall

Beale E M (1977) Integer programming The State of the Art in Numerical Analysis (ed D A H Jacobs) Academic Press

Dantzig G B (1963) Linear Programming and Extensions Princeton University Press

IBM (1971) MPSX – Mathematical programming system Program Number 5734 XM4 IBM Trade Corporation, New York

Mitra G (1973) Investigation of some branch and bound strategies for the solution of mixed integer linear programs Math. Programming 4 155–170

Williams H P (1993) Model Building in Mathematical Programming (3rd Edition) Wiley