H02BZF extracts more information associated with the solution of an integer programming problem computed by
H02BBF.
H02BZF extracts the following information associated with the solution of an integer programming problem computed by
H02BBF. The upper and lower bounds used for the solution, the Lagrange-multipliers (costs), and the status of the variables at the solution.
In the branch and bound method employed by
H02BBF, the arrays
BL and
BU are used to impose restrictions on the values of the integer variables in each sub-problem. That is, if the variable
${x}_{j}$ is restricted to take value
${v}_{j}$ in a particular sub-problem, then
${\mathbf{BL}}\left(j\right)={\mathbf{BU}}\left(j\right)={v}_{j}$ is set in the sub-problem. Thus, on exit from this routine, some of the elements of
BL and
BU which correspond to integer variables may contain these imposed values, rather than those originally supplied to
H02BBF.
None.
If on entry
${\mathbf{IFAIL}}={\mathbf{0}}$ or
${-{\mathbf{1}}}$, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
Not applicable.
None.
One of the applications of integer programming is to the so-called diet problem. Given the nutritional content of a selection of foods, the cost of each food, the amount available of each food and the consumer's minimum daily nutritional requirements, the problem is to find the cheapest combination. This gives rise to the following problem:
The following program solves the above problem to obtain the optimal integer solution and then examines the effect of increasing the energy required to $2200$ units.