Summary
The paper describes experiences with the determination of all economically meaningful dual values of primal degenerate optima in linear programs. To accomplish this task, a hopefully small subset of the informative nodes of the negative optimum degeneracy graph has to be determined by dual simplex iterations. Several heuristics for determining the pivot rows of the postoptimal dualsimplex iterations are defined and compared experimentally. Furthermore, the relationship between the number of optimal bases and the number of computed bases is being investigated.
Keywords
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.
Zusammenfassung
Der Beitrag beschreibt Erfahrungen mit der Ermittlung aller ökonomisch relevanten Dualwerte eines linearen Programms in einem primal degenerierten Optimum. Dazu ist eine möglichst kleine Teilmenge der informativen Knoten des optimalen negativen Degenerationsgraphen mit Hilfe von Dualsimplexiterationen zu bestimmen. Verschiedene Heuristiken zur Bestimmung der Pivotzeilen der postoptimalen Dualsimplexiterationen werden definiert und experimentell verglichen. Ferner wird der Zusammenhang zwischen der Zahl der optimalen Basen und der zur Bestimmung der interessierenden Informationen aufzusuchenden Basen betrachtet.
Keywords
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gal, T., Determination of all neighbors of a degenerate extreme point in polytopes, Diskussionsbeitrag Nr. 17 b, Hagen 1978.
Gal, T., On the Structure of the Set Bases of a Degenerate Point, in: Journal of Optimization Theory and Applications 45 (1985), 577–589.
Gal, T., Degeneracy Graphs — Theory and Application, A State-of-the-Art Survey, Diskussionsbeitrag Nr. 142, Fernuniversität Hagen, 1989.
Klöber, M., Entwicklung eines Programmsystems zur Bestimmung aussagefähiger Dualwerte in primal degenerierten Optimallösungen linearer Programme. Diplomarbeit, Universität Kiel 1986.
Knolmayer, G., How many sided are shadow prices at degenerate primal optima?, in: Omega 4 (1976), 493–494.
Knolmayer, G., Programmierungsmodelle für die Produktionsprogrammplanung, Basel-Boston-Stuttgart: Birkhäuser 1980.
Knolmayer, G., An Algorithm for Decision Oriented Factor and Process Evaluation and its Implementation, in: W. Bühler et al. (Eds.), Operations Research Proceedings 1982, Berlin-Heidelberg-New York: Springer 1983, 381–387.
Knolmayer, G., The Effects of Degeneracy on Cost-Coefficient Ranges and an Algorithm to Resolve Interpretation Problems, in: Decision Sciences 15 (1984), 14–21.
Kruse, H.-J., Degeneracy graphs and the neighbourhood problem, Berlin et al.: Springer 1986.
Luenberger, D.G., Introduction to Linear and Nonlinear Programming, Reading et al.: Addison-Wesley 1973.
Murtagh, B.A., Saunders, M.A., MINOS/Augmented User’s Manual, Technical Report SOL 80–14, Department of Operations Research, Stanford University, 1980.
Piehler, G., Postoptimale Analyse für entartete lineare Optimierungsprobleme, in: K.-P. Kistner et al. (Eds.), Operations Research Proceedings 1989, Berlin et al.: Springer 1990, 521–528.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Knolmayer, G., Klöber, M. (1992). Heuristics for Determining a Minimal Set of Informative Nodes in the Optimum Degeneracy Graph. In: Bühler, W., Feichtinger, G., Hartl, R.F., Radermacher, F.J., Stähly, P. (eds) Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung. Operations Research Proceedings, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77254-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-77254-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55081-5
Online ISBN: 978-3-642-77254-2
eBook Packages: Springer Book Archive