On the Use of Bregman's Balancing Method for the Solution of Relaxed Distribution Problems
- 1 March 1981
- journal article
- research article
- Published by SAGE Publications in Environment and Planning A: Economy and Space
- Vol. 13 (3) , 267-271
- https://doi.org/10.1068/a130267
Abstract
Relaxed distribution models have recently been proposed by several authors. In this note we point out that Bregman's method may be applied directly to these problems, to yield very simple balancing methods. The convergence of these methods follows directly from Bregman's general proof.Keywords
This publication has 6 references indexed in Scilit:
- A note on solution of large sparse maximum entropy problems with linear equality constraintsMathematical Programming, 1980
- The effect of round-off error on computed solutions of trip distribution problemsTransportation Research Part B: Methodological, 1979
- The analysis of entropy models with equality and inequality constraintsTransportation Research Part B: Methodological, 1979
- A flexible doubly-constrained trip distribution modelTransportation Research, 1977
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967