Solving a bar cutting problem using APL2

Solving a bar cutting problem using APL2

0.00 Avg rating0 Votes
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:
Keywords: cutting stock, programming: linear
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.