๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Local decomposition methods for linear programming

โœ Scribed by C. van de Panne

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
756 KB
Volume
28
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

The paper proposes decomposition methods for primal and dual block-angular systems. The decomposition used is called local because it depends on the basic solution considered. The entire problem is decomposed into a principal problem and independent subproblems. In the dual and primal local decomposition methods, parametric solutions to the subproblems are interacting with the principal problem.

๐Ÿ“œ SIMILAR VOLUMES

Complexity analysis of logarithmic barri
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
โœ Zhi-Quan Luo; C. Roos; T. Terlaky ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 816 KB

In this paper, we analyze a logarithmic barrier decomposition method for solving a semi-infinite linear programming problem. This method is in some respects similar to the column generation methods using analytic centers. Although the method was found to be very efficient in the recent computational

A class of methods for linear programmin
A class of methods for linear programming
โœ Markku Kallio; Evan L. Porteus ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 436 KB