Steepest Ascent Decomposition Methods for Mathematical Programming/Economic Equilibrium Energy Planning Models
Name
OR-046-76.pdf
Size
1.03 MB
Format
Adobe PDF
Checksum (MD5)
aba43f43867107c0270c3f6336f5b3ee
Author(s)
Shapiro, Jeremy F., 1939-
Date Issued
February 1976
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 046-76
Abstract
A number of energy planning models have been proposed for combining econometric submodels which forecast the supply and demand for energy commodities with a linear programming submodel which optimizes the processing and transportation of these commodities. We show how convex analysis can be used to decompose these planning models into their econometric and linear programming components. Steepest ascent methods are given for optimizing the decomposition, or equivalently, for computing economic equilibria for the planning models.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
