MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Steepest Ascent Decomposition Methods for Mathematical Programming/Economic Equilibrium Energy Planning Models

Author(s)
Shapiro, Jeremy F., 1939-
Thumbnail
DownloadOR-046-76.pdf (1.027Mb)
Metadata
Show full item record
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.
Date issued
1976-02
URI
http://hdl.handle.net/1721.1/5134
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 046-76

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.