Decomposition of Two-Block Optimization Problems

Tools

Nurminski, E.A. ORCID: https://orcid.org/0000-0002-7236-6955 (1981). Decomposition of Two-Block Optimization Problems. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-81-073

[thumbnail of WP-81-073.pdf]
Preview
 Text
WP-81-073.pdf
Download (360kB) | Preview

Abstract

This paper is concerned with the problem of balancing an optimization model consisting of two submodels. The submodels are represented by separate linear programming problems and are linked by dependence on common resources, or by the presence of the same variables in both of them.

The method for coordinating the activities of submodels, in order to reach an overall optimum, is based on the direct exchange of proposals between submodels. Computational improvements in comparison with the conventional master-subproblems scheme 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:49
Last Modified: 27 Aug 2021 17:10
URI: https://pure.iiasa.ac.at/1688

Actions (login required)

View Item View Item
CORE (COnnecting REpositories)