We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.

Now, to get started on the simplex method, we set all the original variables (x1 and x2 in the case of the XYZ company) to zero, and let the slack variables be non-zero. So for the XYZ problem, the ...

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...