Time Step vs. Dynamic Optimization of Generation-Capacity- Expansion Programs of Power Systems
Article Abstract:
The capacity expansion problem of power generation requires finding the type, size, and generation additions to meet growing demand. Many models are used to find the minimum discounted sum of the investments and operating costs. The models are complex. A time-step model offers major computational savings over the usual dynamic approach. It deals with each time period separately. It cannot account for future developments in determining present value decisions. Often that is not a problem. Computational results are presented in tables.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
User Contributions:
Comment about this article or add new information about this topic:
Capacity Expansion-Contraction of a Facility with Demand Augmentation Dynamics
Article Abstract:
Capacity must be added when the demand exceeds planned capacity during any period of a multiplanning horizon. An optimal management strategy minimizing the sum of capital, maintenance, labor and underprovision costs is obtained. Dynamic programming is used. Since demand projections are uncertain, the formulation and study of a stochastic capacity model is required.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems. A Convexity Result for a Class of GI-G-1 Queueing Systems
- Abstracts: The strategy of trade sanctions in international environmental agreements
- Abstracts: Decision-Aiding Models: Validation, Assessment, and Related Issues of Policy Analysis. Decreasing Failure Rates and Related Issues in the Social Sciences
- Abstracts: Oil Stockpiles and Import Reductions: A Dynamic Programming Approach. Solving Large-Scale Zero-One Linear Programming Problems
- Abstracts: The Discrete-time Sequencing Expansion Problem. There Are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs