| 000 | 02876nam a2200421 4500 | ||
|---|---|---|---|
| 005 | 20260818115017.0 | ||
| 008 | 240039q th eng | ||
| 035 | _a.b10030311 | ||
| 099 | 9 | _aAIT Thesis no. 1174 | |
| 100 | 1 | _aCheng, Kuo-chen | |
| 245 | 1 | 2 | _aA generation expansion planning of nuclear plants in Taiwan |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1977 |
||
| 300 | _a96 p. | ||
| 490 | 1 |
_aThesis ; _vno. 1174 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 1977 | ||
| 520 | _aThe study reported herein is concerned with a procedure for determining the optimal plan for the expansion of the nuclear generation facilities of the Taiwan power system over a 20-year period. Production cost estimation is based on probability simulation methods. Dynamic programming is formulated for the problem over the period of study. In order to treat uncertainty in a systematic manner, the approach yields a step-by-step minimum cost for each year. The primary advantage of the procedure is the ability of combining the constraints of system reliability with the determined cost of production in a fast and efficient way. Together with a reduced state fashion in the dynamic programming formulated, the procedure allows the rapid calculation of the optimal expansion plan. The computational features are described and the expansion planning of the Taiwan power system has been used to demonstrate a practical application. | ||
| 650 | 0 | _aDynamic programming | |
| 650 | 0 |
_aAtomic power-plants _xTaiwan _xMathematical models |
|
| 700 | 0 |
_aTechapun Raengkhum, _eChairperson |
|
| 700 | 1 |
_aKirby, E.S., _eExamination Committee |
|
| 700 | 1 |
_aI, Fude, _eExamination Committee |
|
| 710 | 2 |
_aGovernment of Republic of China, _eScholarship Donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. 1174 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B23226 |
||
| 907 |
_a.b10030311 _bmnait _cx |
||
| 902 | _a251215 | ||
| 998 |
_b2 _c951012 _dm _ea _fx _g2 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050003023263 _bCREATED : 1994-05-16 _cRECORD # : i10013611 _dLPATRON : 1016187 _eLCHKIN : 2003-08-06 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 2 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050004296967 _bCREATED : 1994-05-16 _cRECORD # : i10013623 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160088034 _bCREATED : 2016-04-05 _cRECORD # : i12971558 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c49375 _d49375 |
||