Investment Programming for Interdependent Production Processes

1325 22 1351 3 2676 document 1351 WP-80-144.pdf application/pdf a6d17ed12aa06745f1a795d282976bf5 MD5 2394232 2016-01-15 01:47:45 https://pure.iiasa.ac.at/id/eprint/1325/1/WP-80-144.pdf 1325 1 1 text en public

WP-80-144.pdf

22 85587b825cea8af7f51d36c3872540288c726e1e 25889 2 37621 document 25889 lightbox.jpg image/png 19dec999394cecd9703ae5e615f611a2 MD5 15772 2016-01-15 19:39:16 https://pure.iiasa.ac.at/id/eprint/1325/2/lightbox.jpg 1325 2 2 image/png other Thumbnails conversion from text to thumbnail_lightbox en public

lightbox.jpg

preview.jpg

medium.jpg

small.jpg

indexcodes.txt

WP-80-144.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/1351 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/1351 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/1351 archive 351 disk0/00/00/13/25 2016-01-15 01:47:45 2021-08-27 17:09:46 2016-01-15 01:47:45 monograph show 2 Fensterseifer J.E. AL0111 Investment Programming for Interdependent Production Processes pub iis_mnt iis_met iis_mod prog_sds In this study a solution procedure is developed for a class of industrial investment planning models which incorporates the following features: economies-of-scale in production, intermediate input-output relationships among production activities, and joint production of different products having common processing requirements (capacity sharing). The model is formulated as a mixed integer programming problem. It is single-period and disregards spatial considerations. The choice is between domestic production and imports (make-buy) to satisfy exogenously stated demands for a given set of interrelated products. A two-stage solution procedure was developed and specialized to various specifications of the planning model. At the first stage simple sufficiency conditions for import and for domestic production of a given product are systematically applied in an attempt to reduce the size of the problem. At the second stage (solution stage) an LP-based branch-and-bound (B-B) algorithm is used. Data from the mechanical engineering (metal working) sector of the Republic of Korea was used to implement the proposed two-stage solution procedure. The results from 25 test problems generated from the Korean data provide strong evidence of the efficiency of the approach. Moreover, computational experience with the B-B stage alone indicates that very large problems can be efficiently solved without dependence on the success of any form of problem reduction attempt. 1980-10 published WP-80-144 WP-80-144 1871 public working_paper IIASA, Laxenburg, Austria 100 FALSE info:eu-repo/semantics/book