000 02273nam a2200265 a 4500
001 vtls000067870
003 KUKTEM
005 20251114204534.0
008 121219t2012 my a f m 000 0 eng d
020 _aTHE0003775(Local)
039 9 _a201905131520
_bshah
_y201212191536
_zFida
040 _aUMP
090 _aTP155.7 .S93 2012 rs Bc.
100 0 _aWan Muhammad Syahmi Wan Muhammad
245 1 0 _aDesign of minimum water network for global water operation /
_cWan Muhammad Syahmi Wan Muhammad
260 _aKuantan, Pahang :
_bUMP,
_c2012
300 _axi, 41 p. :
_bill. (some col.) ;
_c30 cm. +
_e1 CD-ROM
502 _aProject paper (Bachelor of Chemical Engineering) -- Universiti Malaysia Pahang - 2012
504 _aBibliography : p. 31-32
520 3 _aWater is key utilities in process industry. A reduction of this utility can reduce plant capital as well as operating cost. Though there are graphical techniques that often are use but mathematical modelling techniques can produce global optimal solution which means it best techniques to be used. In this paper, a new systematic design methodology has been developed for the water minimization involving multiple-contaminant systems that also feature maximum re-use water. In this study, the proposed model is developed based on linear programming (LP). The technique consists of four main steps, i.e. limiting water and energy data extraction, superstructure representation, mathematical formulation, and finally, result analysis. This technique is applicable to mass transfer based and non-mass transfer based (global water operations). The proposed methodology is mathematically rigorous and targets the minimum utility requirement satisfying for detailed design of the water allocation network. The model is successfully implemented on in two industrial case studies involving petroleum refinery and chlor-alkali plant. The proposed model also can guarantee the global optimal solution. Through this approach, the optimal design of the water network can be achieved.
650 0 _aSustainable engineering
650 0 _aChemical processes
650 0 _aChemical industry
_xEnergy conservation
999 _aVIRTUA40
_c3770
_d3776
999 _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*6502*9992