AI SearchAn application of the linear programming technique in one- and two-dimensional stock cutting problems
Raza, Sohail
An application of the linear programming technique in one- and two-dimensional stock cutting problems - Bangkok : Asian Institute of Technology, 1983 - v, 92 p. - Thesis ; no. ST-83-14 . - Asian Institute of Technology. Thesis ; no. ST-83-14 .
A thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1983
Optimization in the use of construction resources on a project is always worthwhile . Using a minimal quantity of the available mate ria ls to fulfil given set o f demand c an r educe the construction cost considerably. The possibility of cutting out the required sizes of one- and two-dimensional objects, using as little stock as possible, has been explored in this report. The linear programming technique has been used as the basic tool for optimization and the study is computer-oriented . An attempt has been made to keep the resulting patterns simple and practicable, even at the cost at a little relaxation in optimality. The IBM package MPSX/MIP-370 h as been used to solve the linear programming problems. For the two dimensional problem, several types of arrangement o f the demand sizes have been tried on sample examples to heuristically find the arrangement that gives the most economical results
Cutting--Linear programming
An application of the linear programming technique in one- and two-dimensional stock cutting problems - Bangkok : Asian Institute of Technology, 1983 - v, 92 p. - Thesis ; no. ST-83-14 . - Asian Institute of Technology. Thesis ; no. ST-83-14 .
A thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1983
Optimization in the use of construction resources on a project is always worthwhile . Using a minimal quantity of the available mate ria ls to fulfil given set o f demand c an r educe the construction cost considerably. The possibility of cutting out the required sizes of one- and two-dimensional objects, using as little stock as possible, has been explored in this report. The linear programming technique has been used as the basic tool for optimization and the study is computer-oriented . An attempt has been made to keep the resulting patterns simple and practicable, even at the cost at a little relaxation in optimality. The IBM package MPSX/MIP-370 h as been used to solve the linear programming problems. For the two dimensional problem, several types of arrangement o f the demand sizes have been tried on sample examples to heuristically find the arrangement that gives the most economical results
Cutting--Linear programming