The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

Operations Research, Vol. 33, No. 4 (Jul. - Aug., 1985), pp. 803-819 (17 pages) We present methods that are useful in solving some large scale hierarchical planning models involving 0-1 variables.

Solving linear programming problems in a spreadsheet yields equations for maximizing business profits. As applied to business, linear programming typically involves an objective formula, such as ...