On solution of multicoupled models
This paper presents a structure-preserving solution approach to large- scale linear programming problems which exhibit a nested (multicoupled) angular coefficient structure. The proposed method may be viewed as a recursive application of the Gass dualplex method designed for dual angular models, whereby the required subproblems are coordinated together by a presented dual pricing relationship. The use of the proposed multicoupled algorithm allows solution of the problem without any matrix density increases outside the original angular blocks and also permits multiple pivot operations to take place unlike the normal simple approach. A detailed example is also discussed.
- A Comparative Study of Two Methods for Staircase Linear Programs
- A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
- An algorithm for hierarchical optimization of large-scale problems with nested structure
- Decomposition Principle for Linear Programs
- Generalized upper bounding techniques
- scientific article; zbMATH DE number 3856813 (Why is no real title available?)
- scientific article; zbMATH DE number 3668319 (Why is no real title available?)
- scientific article; zbMATH DE number 3333881 (Why is no real title available?)
- Large-scale linear programming: Geometry, working bases and factorizations
- On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem
- Primal partition programming for block diagonal matrices
- The simplex method of linear programming using LU decomposition
This page was built for publication: On solution of multicoupled models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088906)
