Biproportional Matrix Balancing with Upper Bounds

  • Heinz Spiess
Part of the Applied Optimization book series (APOP, volume 63)

Abstract

The purpose of the note is to look at the problem of biproportional matrix balancing when upper bounds are imposed on the matrix elements. This problem can be formulated as a convex minimization problem. Using the Kuhn-Tucker optimality conditions the functional form of the resulting model is derived. The dual formulation of the problem is derived and it is shown how it can be solved by a cyclic coordinate descent method. This leads to the proposal of an efficient solution algorithm.

Keywords

Dual Problem Dual Variable Dual Formulation Convex Minimization Problem Coordinate Descent Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bregman, L. (1967). “The Relaxation Method of Finding the Common Point of Convex Sets and its Application to the Solution of Problems in Convex Programming,” U.S.S.R. Computational Math. Mathematical Phys. 7, 200–217.CrossRefGoogle Scholar
  2. Chabini, I. and Florian, M. (1995). “An Entropy Based Primal-Dual Algorithm for Convex and Linear Cost Transportation Problems,” Centre de recherche sur les transports, Université de Montréal, Publication 963 (CRT #95–17).Google Scholar
  3. Evans, S.P. and Kirby, H.R. (1974). “A Three-Dimensional Furness Procedure for Calibrating Gravity Models,” Transportation Research, 8, 105–122.CrossRefGoogle Scholar
  4. Furness, K.P. (1970). “Time Function Interaction,” Traffic Engineering and Control Vol 7, No 7, 19–36.Google Scholar
  5. INRO Consultants Inc. (1997). EMME/2 User’s Manual.Google Scholar
  6. Lamond, B. and Stewart, N.F. (1981). “Bregman’s Balancing Method,” Transportation Research, 15B, 239–248.CrossRefGoogle Scholar
  7. Luenberger, D.G. (1984). Linear and Nonlinear Programming. Second Edition, Addison-Wesley.Google Scholar
  8. Murchland, J. (1977). The Multi-proportional Problem. Univerity College London, research note JDM 263.Google Scholar
  9. Spiess, H. (1984). Contributions à la théorie et aux outils de planification de réseaux de transport urbain. Ph.D. thesis, Département d’informatique et de recherche opérationnelle, Publication 382, Centre de recherche sur les transports, Université de Montréal.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Heinz Spiess

There are no affiliations available

Personalised recommendations