A case of non-convergent dual changes in assignment problems

Authors:
Julián Aráoz;Jack Edmonds
Affiliations:
Institut für Okonometrie und Operation Research, Universität Bonn, W. Germany and Depanamento de Procesos y Sistemas, Universidad Simon Bolivar, Caracas, Venezuela;-
Venue:
Discrete Applied Mathematics
Year:
1985

Citing 2
Cited 0

Introduction to operations research, 4th ed.

Introduction to operations research, 4th ed.
Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)

Quantified Score

Hi-index	0.04

Visualization

Abstract

We give an example of iterative dual changes in Assignment Problems which does not converge to the solution. To built up the example we use properties of the Fibonacci Sequence.