# Difference between revisions of "Column generation algorithms"

Authors: Kedric Daly[2015]
Stewards: Dajun Yue, Fengqi You

# Introduction

Column generation algorithms are used for MILP problems. The formulation was initially proposed by Ford and Fulkerson in 1958[1]. The main advantage of column generation is that not all possibilities need to be enumerated. Instead, the problem is first formulated as a restricted master problem (RMP). This RMP has as few variables as possible, and new variables are brought into the basis as needed, similar to the simplex method[2].

# Formulation

The formulation of the column generation problem depends on the type of problem. One common example is the cutting stock problem. However, all cases involve taking the original problem and formulating the RMP as well as a subproblem. The solution of the RMP determines some of the parameters in the subproblem whereas the subproblem will be used to determine if there are any columns which can enter the basis. The subproblem does this by solving for the minimum reduced cost. If the reduced cost is negative, the solution can enter the basis as a new column. If the reduced cost is greater than or equal to zero, the lower bound for the optimal solution has been found, although this may not be an integer solution.

# Examples

## Cutting Stock Problem (CSP)

In the cutting stock problem, the goal is to minimize the waste obtained from cutting rolls of fixed size (called "raws") while fulfilling customer orders.

For example, we may have steel rods of length L = 17m, with customer orders for twenty-five 3m length rods, twenty 5m length rods, and fifteen 9m length rods. Thus

Column Generation Formulation
For the column generation formulation, the different patterns the rods can be cut into are the main focus[6].

Let $P$ be the set of all patterns that can be cut.
Let $a_ip$ be the number of pieces of length $li$ cut in pattern p.

Let $b_i$ be the demand for each piece of length $li$. Thus,

Let $x_p$ be the number of times pattern $p$ is cut. Then the column generation RMP and dual are:

An initial set of columns must now be selected. This can be done simply by selecting “fake” columns where we know they will not end up in the solution, or by covering the basis. In this example, an identity matrix can be selected. A better basis-covering initial matrix would take $\left \lfloor L/l_i \right \rfloor$ because we can always cut at least that many bars from our raw. Thus, our initial $A$ matrix is:

Solving the dual of the RMP then yields the dual multiplier . These values are then passed to the sub-problem to see if any columns will be added to $A$. The sub-problem is as follows:

This sub-problem is a knapsack problem which has been studied extensively. Dynamic programming (e.g. branch-and-bound) can be used to solve this knapsack problem [3]. At the end of this sub-problem, we will compute the reduced cost,$c_r$ , to determine whether or not we add the solution column to A. Similar to the simplex algorithm, if the reduced cost is negative, the column is added to the RMP, otherwise we are done adding columns, and the most recent primal solution will give us our lower bound solution to the RMP. Substituting the dual variables and other known quantities into the sub-problem gives us:

The solution of which gives , with a reduced cost of . Since this reduced cost is negative, the column, is added to $A$ in the RMP, and it will replace one of the columns in the basis. After adding the column,

Solving the dual of the new RMP then yields the dual multiplier . Again, these values are passed to the sub-problem and become the coefficients in the objective function. Solving the second iteration of the sub-problem yields with a reduced cost of . Since this reduced cost is negative, the column is added to $A$ and the algorithm continues.

The new dual multipliers become , and after substitution into the sub-problem, we find the solution column has a reduced cost of 0. Since this is not a negative reduced cost, this column is not added to $A$, and column generation stops. The optimal solution can then be found using the most recent version of $A$ and simply optimizing the RMP. The resulting solution for the RMP is which gives an objective value of .

The result is the lower bound of the integer solution for the CSP, and as in this case, is often not an integer. In the case of the CSP, simply rounding up is often enough to obtain a feasible integer solution, which in this case will be 21 raws in order to fill the orders.

# Conclusion

Column generation algorithms are most useful when dealing with large numbers of variables. They are effective because they avoid enumerating all possible elements of a traditional MILP formulation, and instead only evaluate variables as needed. The initial formulation of MILPs using column generation algorithms may be difficult to see at first, but well worth using because of the potential time savings.

# References

[1] L. R. Ford, Jr., D. R. Fulkerson, (1958) A Suggested Computation for Maximal Multi-Commodity Network Flows. Management Science 5(1):97-101. http://dx.doi.org/10.1287/mnsc.5.1.97

[2] Desrosiers, J., & Lübbecke, M. (2005). A Primer in Column Generation. In G. Desaulniers, J. Desrosiers & M. Solomon (Eds.), Column Generation (pp. 1-32): Springer US.