Skip to main content
SpringerLink
Log in

Selected bibliography on degeneracy

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

A selected bibliography on degeneracy problems organized according to the appearance of the respective references in various fields of operations research is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Abel, On the choice of the pivot columns of the simplex method: gradient criteria, Computing 38 (1987) 13–21.

    Article  Google Scholar 

  2. I. Adler, R. Karp and R. Shamir, A family of simplex variants solving anm × d linear program in expected number of pivot steps depending ond only, Math. Oper. Res. 11 (1986) 570–590.

    Article  Google Scholar 

  3. J.H. Ahrens and G. Finke, Degeneracy in fixed cost transportation problems, Math. Progr. 8 (1975) 369–374.

    Article  Google Scholar 

  4. R.K. Ahuja, Minimax linear programming problem, Oper. Res. Lett. 4 (1985) 131–134.

    Article  Google Scholar 

  5. M. Akgül, A note on shadow prices in linear programming, J. Oper. Res. Soc. 35 (1984) 425–431.

    Google Scholar 

  6. W. Altherr, An algorithm for enumerating all vertices of a convex polyhedron, Computing 15 (1975) 181–193.

    Article  Google Scholar 

  7. M. Altman, Optimum simplex methods and degeneracy in linear programming, Bull. de l'Acad. Polon. des Sci. 12 (1964) 217–225.

    Google Scholar 

  8. K.M. Anstreicher, Dual ellipsoids and degeneracy in the projective algorithm for linear programming, in:Mathematical Developments Arising from Linear Programming: Proc. Joint Summer Research Conf., Bowdoin College, Brunswick, Maine, USA, June/July 1988, eds. J.C. Lagarias and M.J. Todd, Contemp. Math. 114 (1990) 141–149.

    Google Scholar 

  9. P. Armand, Programmation linéaire multicritère et problèmes de la dégénérescence, Thèse de Doctorat de l'Université de Limoges (1991).

  10. P. Armand, Bounds for the number of vertices of perturbed polyhedra, Ann. Oper. Res. (1993), this volume.

  11. D.C. Aucamp and D.I. Steinberg, On the nonequivalence of shadow prices and dual variables, Technical Report WUCS-78-11, Dept. of Computer Sciences, Washington University, St. Louis, MS (1979).

    Google Scholar 

  12. D.C. Aucamp and D.I. Steinberg, The computation of shadow prices in linear programming, J. Oper. Res. 33 (1982) 557–565.

    Google Scholar 

  13. D. Avis and V. Chvátal, Notes on Bland's pivoting rule, Math. Progr. Study 8 (1978) 35–49.

    Google Scholar 

  14. A.G. Azpeita and D.J. Dickinson, A decision rule in the simplex method that avoids cycling, Numer. Mathematik 6 (1964) 329–331.

    Article  Google Scholar 

  15. M.L. Balinski, An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Ind. Appl. Math. 9 (1961) 72–88.

    Article  Google Scholar 

  16. M.L. Balinski and J. Gale, The core of assignment games, Working Paper AD 2980487, Ecole Polytechnique de Paris (1985).

  17. M.L. Balinski, Th.M. Liebling and A.-E. Nobs, On the average length of lexicographic paths, Math. Progr. 35 (1986) 362–364.

    Article  Google Scholar 

  18. E.R. Barnes, A variation of Karmarkar's algorithm for solving linear programming problems, Math. Progr. 36 (1986) 174–182.

    Article  Google Scholar 

  19. E.R. Barnes, Some results concerning convergence of the affine scaling algorithm, in:Mathematical Developments Arising from Linear Programming, Proc. Joint Summer Research Conf., Bowdoin College, Brunswick, Maine, June/July 1988, eds. J.C. Lagarias and M.J. Todd, Contemp. Math. 114 (1990) 131–139.

    Google Scholar 

  20. R.S. Barr, F. Glover and D. Klingman, The alternating basis algorithm for assignment problems, Math. Progr. 13 (1977) 1–13.

    Article  Google Scholar 

  21. R.S. Barr, F. Glover and D. Klingman, The generalized alternating path algorithm for transportation problems, Eur. J. Oper. Res. 2 (1978) 137–144.

    Article  Google Scholar 

  22. H.G. Bartels, Glanz und Elend konvexer Polyeder, Wirtschaftswissenschaftliches Studium 9 (1988) 433–437.

    Google Scholar 

  23. R.H. Bartels, A.R. Conn and C. Charambolous, On Cline's direct method for solving over-determined linear systems in thel ∞ sense, SIAM J. Numer. Anal. 15 (1978) 255–270.

    Article  Google Scholar 

  24. R.H. Bartels, A.R. Conn and J.W. Sinclair, Minimization techniques for piecewise differentiable functions: Thel 1 solution to an overdetermined linear system, SIAM J. Numer. Anal. 15 (1978) 224–241.

    Article  Google Scholar 

  25. E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Res. Log. Quart. 2 (1955) 269–276.

    Article  Google Scholar 

  26. M. Benichou, J.M. Gauthier, G. Hentges and G. Ribière, The efficient solution of large-scale linear programming problems — some algorithmic techniques and computational results, Math. Progr. 13 (1977) 280–322.

    Article  Google Scholar 

  27. J.R. Birge and C. Rosa, A simplified proof of the general convergence of affine scaling, Technical Report 91-7, Dept. of Oper. Res., University of Michigan, Ann Arbor (1991).

    Google Scholar 

  28. R.G. Bland, New finite pivoting rules for the simplex method, Math. Oper. Res. 2 (1977) 103–107.

    Article  Google Scholar 

  29. K. Boenchendorf, An optimality criterion for degenerated transportation problems, in:Methods of Operations Research 57, eds. Domschke et al. (1987) pp. 87–94.

  30. P.H. Calamai and C. Charambolous, Solving multifacility location problems involving Euclidean distances, SIAM J. Sci. Stat. Comput. 1 (1980) 609–620.

    Google Scholar 

  31. P.H. Calamai and A.R. Conn, A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM J. Sci. Stat. Comput. 1 (1980) 512–526.

    Article  Google Scholar 

  32. P.H. Calamai and A.R. Conn, A second-order method for solving the continuous multifacility location problem, in:Numerical Analysis, Proc. 9th Biennial Conf., Dundee, Scotland, ed. G.A. Watson, Lecture Notes in Mathematics (Springer, 1982) pp. 1–25.

  33. P.H. Calamai and J.J. Moore, Projected gradient methods for linearly constrained problems, Math. Progr. 39 (1987) 93–116.

    Article  Google Scholar 

  34. N. Cameron, Stationarity in the simplex method, J. Austral. Math. Soc., Series A 43 (1987) 137–142.

    Article  Google Scholar 

  35. Y.Y. Chang and R.W. Cottle, Least-index resolution of degeneracy in quadratic programming, Math. Progr. 18 (1980) 27–37.

    Article  Google Scholar 

  36. A. Charnes, Optimality and degeneracy in linear programming, Econometrica 20 (1952) 160–170.

    Article  Google Scholar 

  37. M. Cirina, Remarks on a recent simplex pivoting rule, in:Methods of Operations Research 55: Proc. 9th Symp. on Operations Research, Königsstein/Ts, eds. W. Domschke et al. (1985) pp. 187–199.

  38. W.H. Cunningham, Theoretical properties of the network simplex method, Math. Oper. Res. 4 (1979) 196–208.

    Article  Google Scholar 

  39. W.H. Cunningham and J.G. Klincewicz, On cycling in the network simplex method, Math. Progr. 26 (1983) 182–189.

    Article  Google Scholar 

  40. G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, 1963).

  41. G.B. Dantzig, Making progress during a stall in the simplex algorithm, Lin. Alg. Appl. 114/115 (1989) 251–259.

    Article  Google Scholar 

  42. G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math. 5 (1955) 183–195.

    Google Scholar 

  43. A. Dax, On computational aspects of bounded linear least squares problems, ACM Trans. Math. Soft. 17 (1991).

  44. U. Derigs, Neuere Ansätze in der linearen Optimierung — Motivation, Konzepte und Verfahren, in:Operations Research Proc., eds. L. Streitferdt et al. (Springer, 1986) pp. 47–58.

  45. U. Derigs, On three basic methods for solving bottleneck transportation problems, Naval Res. Log. Quart. 29 (1982) 505–515.

    Article  Google Scholar 

  46. M.E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8 (1983) 381–402.

    Article  Google Scholar 

  47. M.E. Dyer and L.G. Proll, An algorithm for determining all extreme points of a convex polytope, Math. Progr. 12 (1977) 81–96.

    Article  Google Scholar 

  48. M.E. Dyer and L.G. Proll, An improved vertex enumeration algorithm, Eur. J. Oper. Res. 9 (1982) 359–368.

    Article  Google Scholar 

  49. J.R. Evans and N.R. Baker, Degeneracy and the (mis)interpretation of sensitivity analysis in linear programming, Dec. Sci. 13 (1982) 348–354.

    Article  Google Scholar 

  50. B. Fleischmann, Duale und primale Schnittebenenverfahren in der ganzzahligen linearen Optimierung, Dissertation, Universität Hamburg (1970).

  51. R. Fourer, A simplex algorithm for piecewise-linear programming II: finiteness, feasibility and degeneracy, Math. Progr. 41 (1988) 281–315.

    Article  Google Scholar 

  52. T. Gal, A general method for determining the set of all efficient solutions to a linear vector-maximum problem, Eur. J. Oper. Res. 1 (1977) 307–322.

    Article  Google Scholar 

  53. T. Gal,Postoptimal Analyses, Parametric Programming, and Related Topics (McGraw-Hill, 1979).

  54. T. Gal, On the structure of the set bases of a degenerate point, J. Optim. Theory Appl. 45 (1985) 577–589.

    Article  Google Scholar 

  55. T. Gal, Shadow prices and sensitivity analysis in linear programming under degeneracy — State-of-the-art survey, OR Spektrum 8 (1986) 59–71.

    Article  Google Scholar 

  56. T. Gal, Degeneracy in mathematical programming and degeneracy graphs, ORiON 6 (1990) 3–36.

    Google Scholar 

  57. T. Gal, Weakly redundant constraints and their impact on postoptimal analyses, Eur. J. Oper. Res. 60 (1992) 315–326.

    Article  Google Scholar 

  58. T. Gal, Degeneracy graphs: Theory and application — A survey, Ann. Oper. Res. (1993), this volume.

  59. T. Gal and F. Geue, A new pivoting rule for solving various degeneracy problems, Oper. Res. Lett. 11 (1992) 23–32.

    Article  Google Scholar 

  60. T. Gal, H.-J. Kruse and P. Zörnig, Survey of solved and open problems in the degeneracy phenomenon, Math. Progr. 42 (1988) 125–133.

    Article  Google Scholar 

  61. R.S. Garfinkel and M.R. Rao, Bottleneck linear programming, Math. Progr. 11 (1976) 291–298.

    Article  Google Scholar 

  62. S.I. Gass, Comments on the possibility of cycling with the simplex method, Oper. Res. 27 (1979) 848–852.

    Article  Google Scholar 

  63. B.J. Gassner, Cycling in the transportation problem, Naval Res. Log. Quart. 11 (1964) 43–58.

    Article  Google Scholar 

  64. D.M. Gay, Electronic mail distribution of linear programming test problems, Math. Progr. Soc. COAL Newsletter 1 (1985).

  65. F. Geue, Eckenabsuchende Verfahren unter Entartung: Theorie, Algorithmen und Vergleichtests, Dissertation, FernUniversität Hagen (1993).

  66. P.E. Gill, W. Murray and M.H. Wright,Numerical Linear Algebra and Optimization, Vol. 1 (Addison-Wesley, Redwood City, 1991).

    Google Scholar 

  67. H.J. Greenberg, An analysis of degeneracy, Naval. Res. Log. Quart. 33 (1986) 635–655.

    Article  Google Scholar 

  68. O. Güler, D. den Hertog, C. Roos, T. Terlaky and T. Tsuchiya, Degeneracy in interior point methods for linear programming, Ann. Oper. Res. (1993), this volume.

  69. B. Gupta and R. Gypta, Multi-criteria simplex method for a linear multiple objective transportation problem, Indian J. Pure Appl. Math. 14 (1983) 222–232.

    Google Scholar 

  70. P.L. Hammer, Time-minimizing transportation problems, Naval Res. Log. Quart. 16 (1969) 345–357.

    Google Scholar 

  71. P.M.J. Harris, Pivot selection methods of the DEVEX LP code, Math. Progr. 5 (1973) 1–28.

    Article  Google Scholar 

  72. R.S. Hattersley and J. Wilson, A dual approach to primal degeneracy, Math. Progr. 72 (1988) 135–176.

    Article  Google Scholar 

  73. A.J. Hoffman, Cycling in the simplex algorithm, National Bureau of Standards Report No. 2974 (1953).

  74. R. Horst, J. de Vries and N.V. Thoai, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Oper. Res. Lett. 7 (1988) 85–90.

    Article  Google Scholar 

  75. H. Isermann, The enumeration of all efficient solutions for a linear multiple objective transportation problem, Naval Res. Log. Quart. 26 (1979) 123–129.

    Article  Google Scholar 

  76. H. Juel, A note on solving multifacility location problems involving Euclidean distance, Naval Res. Log. Quart. 29 (1982) 179–180.

    Article  Google Scholar 

  77. H. Juel and R.F. Love, An efficient computational procedure for solving the multifacility rectilinear location problem, Oper. Res. Quart. 27 (1976) 697–703.

    Article  Google Scholar 

  78. M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts,Redundancy in Mathematical Programming (Springer, 1983).

  79. D.B. Khang and O. Fujiwara, A new algorithm to find all vertices of a polytope, Oper. Res. Lett. 8 (1989) 261–264.

    Article  Google Scholar 

  80. G. Knolmayer, How many sided are shadow prices at degenerate primal optima?, OMEGA 4 (1976) 493–494.

    Article  Google Scholar 

  81. G. Knolmayer, The effect of degeneracy on cost-efficient ranges and an algorithm to resolve interpretation problems, Dec. Sci. 15 (1984) 14–21.

    Article  Google Scholar 

  82. M.M. Kostreva, Cycling in linear complementarity problems, Math. Progr. 16 (1979) 127–130.

    Article  Google Scholar 

  83. T.C.T. Kotiah and D.I. Steinberg, On the possibility of cycling with the simplex method, Oper. Res. 26 (1978) 374–376.

    Article  Google Scholar 

  84. H.-J. Kruse,Degeneracy Graphs and the Neighbourhood Problem, Lecture Notes in Economics and Mathematical Systems No. 260 (Springer, 1986).

  85. Madan Lal Mittal, A note on resolution of degeneracy in transportation problems, Oper. Res. Quart. 19 (1967) 175–184.

    Article  Google Scholar 

  86. T.L. Magnanti and J.B. Orlin, Parametric linear programming and anti-cycling pivoting rules, Math. Progr. 41 (1988) 317–325.

    Article  Google Scholar 

  87. A. Majthay, On degeneracy and cycling with the simplex method, Discussion Paper No. 41, Center for Econometrics and Decision Sciences, University of Florida (1981).

  88. K.T. Marshall and J.W. Suurballe, A note on cycling in the simplex method, Naval Res. Log. Quart. 16 (1969) 121–137.

    Google Scholar 

  89. T.H. Mattheiss and D.S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Oper. Res. 5 (1980) 167–185.

    Article  Google Scholar 

  90. P.G. McKeown, Some computational results of using the Ahrens-Finke method for handling degeneracy in fixed charge transportation problems, Math. Progr. 15 (1978) 355–359.

    Article  Google Scholar 

  91. N. Megiddo, A note on degeneracy in linear programming, Math. Progr. 35 (1986) 365–367.

    Article  Google Scholar 

  92. S. Mehrotra, On finding a vertex solution using interior point methods, Lin. Alg. Appl. 152 (1991) 233–253.

    Article  Google Scholar 

  93. V. Mlynárovič, On shadow prices in convex programming, Mat.-Ekon. Obzor 29 (1988) 201–214.

    Google Scholar 

  94. P. Nash,Algebraic Fundamentals of Linear Programming, Lecture Notes in Economics and Mathematical Systems No. 259 (Springer, 1985) pp. 37–52.

  95. R.R. Nelson, Degeneracy in linear programming: A simple geometrical interpretation, Rev. Econ. Statist. 259 (1957) 402–407.

    Article  Google Scholar 

  96. M. Niggemeier, Entartungserscheinungen bei ganzzahligen Optimierungsproblemen — Eine Übersicht, Diplomarbeit, Fachbereich Wirtschaftswissenschaft, FernUniversität Hagen (1989).

  97. M. Niggemeier, Degeneracy in integer linear optimization problems: A survey, Ann. Oper. Res. (1993), this volume.

  98. B. Nygreen, A possible way to reduce degeneracy in integer programming computations, Oper. Res. Lett. 6 (1987) 47–51.

    Article  Google Scholar 

  99. P.-Q. Pan, Practical finite pivoting rules for the simplex method, OR Spektrum 12 (1990) 219–225.

    Article  Google Scholar 

  100. A.F. Perold, Exploiting degeneracy in the simplex method, in:Large Scale Linear Programming (IIASA, 1981).

  101. J. Philip, Vector maximization at a degenerate vertex, Math. Progr. 13 (1977) 357–359.

    Article  Google Scholar 

  102. L.G. Proll, Goal aggregation via shadow prices — some counterexamples, Large Scale Syst. 12 (1987) 83–85.

    Google Scholar 

  103. R. Ramesh, M.H. Karwan and S. Zionts, Degeneracy in efficiency testing in bi-criteria integer programming, in:Methodology and Software for Interactive Decision Support, presented at IIASA, Laxenburg (1987).

    Google Scholar 

  104. K. Ritter, On parametric linear and quadratic programming problems, Math. Progr. 92 (1984) 307–335.

    Google Scholar 

  105. A. Ruszczynski, A regularized decomposition method for minimizing a sum of polyhedral functions, Math. Progr. 35 (1986) 309–333.

    Article  Google Scholar 

  106. D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes, Math. Progr. 41 (1988) 385–392.

    Article  Google Scholar 

  107. C.R. Seshan and K.K. Achary, On the bottleneck linear programming problems, Eur. J. Oper. Res. 9 (1982) 347–352.

    Article  Google Scholar 

  108. H.D. Sherali and S.E. Dickey, An extreme-point-ranking algorithm for the extreme point mathematical programming problem, Comp. Oper. Res. 13 (1986) 465–475.

    Article  Google Scholar 

  109. V. Srinivasan and G.L. Thompson, Determining cost vs. time Pareto-optimal frontiers in multi-modal transportation problems, Transp. Sci. 11 (1977) 1–19.

    Article  Google Scholar 

  110. J.E. Strum, Note on two-sided shadow prices, J. Account. Res. 7 (1969) 160–162.

    Article  Google Scholar 

  111. J. Telgen, A note on a linear programming problem that cycled, COAL Newsletter 2 (1980) 8–11.

    Google Scholar 

  112. G.L. Thompson, F.M. Tonge and S. Zionts, Techniques for removing nonbinding constraints and extraneous variables from linear programming problems, Manag. Sci. 23 (1966) 588–608.

    Article  Google Scholar 

  113. M.J. Todd, An implementation of the simplex method for linear programming problems with variable upper bounds, Math. Progr. 23 (1982) 34–49.

    Article  Google Scholar 

  114. M.J. Todd, The effects of degeneracy, null and unbounded variables on variants of Karamarkar's linear programming algorithm, in:Large Scale Numerical Optimization, Proc. Workshop, Cornell University, Ithaca, eds. T.F. Coleman and Y. Li (SIAM, 1990) pp 81–91.

  115. M.J. Todd, Probabilistic models for linear programming, Math. Oper. Res. 16 (1991) 671–693.

    Article  Google Scholar 

  116. J.A. Tomlin and J.S. Welch, Formal optimization of some reduced linear programming problems, Math. Progr. 27 (1983) 232–240.

    Article  Google Scholar 

  117. J. Vörös, The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity, Eur. J. Oper. Res. 32 (1987) 302–310.

    Article  Google Scholar 

  118. S.W. Wallace, Pivoting rules and redundancy schemes in extreme point enumeration, BIT 25 (1985) 274–280.

    Article  Google Scholar 

  119. A.C. Williams, Marginal values in linear programming, J. Soc. Ind. Appl. Math. 11 (1963) 82–94.

    Article  Google Scholar 

  120. P. Wolfe, A technique for resolving degeneracy in linear programming, J. Soc. Ind. Appl. Math. 11 (1963) 305–311.

    Article  Google Scholar 

  121. R.D. Young, A simplified primal (all-integer) integer programming algorithm, Oper. Res. 16 (1968) 750–782.

    Article  Google Scholar 

  122. S. Zhang, On anti-cycling pivoting rules for the simplex method, Oper. Res. Lett. 10 (1991) 189–192.

    Article  Google Scholar 

  123. P. Zörnig,Degeneracy Graphs and Simplex Cycling, Lecture Notes in Economics and Mathematical Systems No. 357 (Springer, 1991).

Download references

Author information

Authors and Affiliations

  1. Fern Universität Hagen, Germany

    Tomas Gal

Authors
  1. Tomas Gal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gal, T. Selected bibliography on degeneracy. Ann Oper Res 46, 1–7 (1993). https://doi.org/10.1007/BF02096255

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02096255

Keywords

Search

Navigation