The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

This is a preview. Log in through your library . Abstract The Linear Programming Problem is by far the most widely used optimization model. Its impact on economic and government modeling is immense.

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.