Some Theoretical Considerations on Linkage Problems

Tools

Nurminski, E.A. ORCID: https://orcid.org/0000-0002-7236-6955 (1979). Some Theoretical Considerations on Linkage Problems. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-79-117

[thumbnail of WP-79-117.pdf]
Preview
 Text
WP-79-117.pdf
Download (427kB) | Preview

Abstract

A new decomposition approach is proposed for solving large linear programming problems. This paper contains mainly theoretical results connected with this idea and a small numerical example illustrating the solution. The algorithm is based on ideas of nondifferential optimization and the solution is obtained in a finite number of steps monotonically decreasing an objective function with computational efforts restricted to those with subproblems forming original large-scale problems.

Item Type: Monograph (IIASA Working Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:46
Last Modified: 27 Aug 2021 17:09
URI: https://iiasa-9.eprints-hosting.org/1066

Actions (login required)

View Item View Item
CORE (COnnecting REpositories)
Sorry the service is unavailable at the moment. Please try again later.