Convergence and Numerical Expirements with a Decomposition Algorithm

Nurminski, E.A. ORCID: (1982). Convergence and Numerical Expirements with a Decomposition Algorithm. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-82-008

[thumbnail of WP-82-008.pdf]

Download (633kB) | Preview


This paper gives a proof of convergence of a decomposition algorithm for solution of an optimization model consisting of two submodels. The submodels are represented by separate mathematical programming problems and are linked by dependence on common variables.

The method for coordinating the activities of submodels, in order to reach an overall optimum, is based on the approximation of the original problem, which can be interpreted as the direct exchange of proposals between submodels. Computational improvements in comparison with the conventional master-subproblems schemas are shown.

Item Type: Monograph (IIASA Working Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:51
Last Modified: 27 Aug 2021 17:10

Actions (login required)

View Item View Item