| Article ID: | iaor1996893 |
| Country: | Australia |
| Volume: | 14 |
| Issue: | 2 |
| Start Page Number: | 9 |
| End Page Number: | 13 |
| Publication Date: | Jun 1995 |
| Journal: | ASOR Bulletin |
| Authors: | Beaumont Nick |
| Keywords: | cutting stock, programming: linear |
The bar cutting problem (or one dimensional trim loss problem) is a classical Operational Research OR problem solvable by a variant of linear programming. This article shows how the solution algorithm can be compactly coded in APL2.