Segregated targeting for multiple resource networks using decomposition algorithm
A generalized decomposition technique is presented for determining optimal resource usage in segregated targeting problems with single quality index (e.g., concentration, temperature, etc.) through pinch analysis. The latter problems are concerned with determining minimal resource requirements of pr...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2010
|
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | A generalized decomposition technique is presented for determining optimal resource usage in segregated targeting problems with single quality index (e.g., concentration, temperature, etc.) through pinch analysis. The latter problems are concerned with determining minimal resource requirements of process networks characterized by the existence of multiple zones, each consisting of a set of demands and using a unique external resource. However, all the zones share a common set of internal sources. The decomposition algorithm allows the problem to be decomposed into a sequence of subproblems, each of which can in turn be solved using any established graphical or algebraic targeting methodology to determine the minimum requirement of respective resource. This article presents a rigorous mathematical proof of the decomposition algorithm, and then demonstrates its potential applications with case studies on carbon-constrained energy sector planning, interplant water integration, and energy-based multisector fuel allocation. © 2009 American Institute of Chemical Engineers. |
|---|