01992nam a2200241   450000500170000000800410001703500150005810000170007324501060009026000520019630000130024849000270026150001430028850200580043152009250048965000320141470000360144670000410148270000520152371000510157581000590162685600650168520260817162956.0040898         th                  eng    a.b100705521 aRaza, Sohail13aAn application of the linear programming technique in one- and two-dimensional stock cutting problems  aBangkok :bAsian Institute of Technology,c1983  av, 92 p.1 aThesis ;vno. ST-83-14  aA thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology  aThesis (M.Eng.) - Asian Institute of Technology, 1983  aOptimization 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 0aCuttingxLinear programming1 aWireland, Martin, eChairperson1 aJearkjirm, Vithool, eCo-Chairperson0 aWorsak Kanok-Nukulchai, eExamination Committee2 aGovernment of Switzerland, eScholarship Donor2 aAsian Institute of Technology.tThesis ;vno. ST-83-14  3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B21000