The transportation problem, as a particular case of a linear programme, has probably the highest relative frequency with which appears in applications. At least in its classical formulation, it involves demands and supplies. When, for practical reasons, the total demand cannot satisfy the total supply, the problem becomes unbalanced and inconsistent, and must be reformulated as e.g. finding a least squares solution of an inconsistent system of linear inequalities. A general iterative solver for this class of problems has been proposed by S. P. Han in his 1980 original paper. The drawback of Han’s algorithm consists in the fact that it uses in each iteration the computation of the Moore-Penrose pseudoinverse numerical solution of a subsystem of the initial one, which for bigger dimensions can cause serious computational troubles. In order to overcome these difficulties we propose in this paper a general projection-based minimal norm solution approximant to be used within Han-type algorithms for approximating least squares solutions of inconsistent systems of linear inequalities. Numerical experiments and comparisons on some inconsistent transport model problems are presented.
A general iterative solver for unbalanced inconsistent transportation problems
2016
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Regularized Han-type Algorithms for Inconsistent Maritime Container Transportation Problems
DOAJ | 2014
|REDUCED ORDER SOLVER FOR GENERAL AEROELASTIC PROBLEMS
TIBKAT | 2023
|PHIST: a Pipelined, Hybrid-parallel Iterative Solver Toolkit
German Aerospace Center (DLR) | 2020
|MODEL REDUCTION USING ITERATIVE SOLVER FOR BURGERS EQUATION
British Library Conference Proceedings | 2012
|