Structuring design computations
β Scribed by J. H. Christensen; D. F. Rudd
- Publisher
- American Institute of Chemical Engineers
- Year
- 1969
- Tongue
- English
- Weight
- 643 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0001-1541
No coin nor oath required. For personal study only.
β¦ Synopsis
Process design computations are represented by directed graphs whose edges correspond to streams of information flow between computational units. Algorithm I-R extends existing algorithms for finding the minimal sized blocks of units between which no recycle exists. Algorithm Il-R orders the sequence of unit computations within a block to minimize the number of recycle parameters. Algorithm Ill-R uses the concept of indexing to order computations which evade algorithm Il-R. This work is directed toward the evolution of efficient programs for computer-aided process design,
π SIMILAR VOLUMES
plotterβ’ A record-playback facility permits small assemblies to be stored as packages on magnetic cards; large drawings may be stored on a floppy disc. A balance sheet of advantages and disadvantages is included. Mr R K Hilton had worked in the automobile, steam-turbine, glass making, cablemaking a
## Abstract The structural design problem is acknowledge to be commonly multiβcriteria in nature. The various bases for multiβcriteria optimization methodologies are outlined and a computationally viable method for generating Pareto optimal solutions is adopted for the structural design problem whe