Skip to main content
SpringerLink
Log in

Investigation of optimization methods and their applications

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. I. Artemenko and I. V. Sergienko, “A method for solution of linear programs with 0–1 variables,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 4, 72–75 (1980).

    Google Scholar 

  2. T. A. Arkhipova and I. V. Sergienko, “On conditions under which local and global extrema in optimization problems coincide,” Kibernetika, No. 1, 113–115 (1975).

    Google Scholar 

  3. O. O. Bakaev, S. V. Branovitskaya, and V. S. Mikhalevich, “Determination of transportation network parameters by methods of sequential analysis of alternatives,” Dokl. Akad. Nauk UkrSSR, No. 4, 472–474 (1962).

    Google Scholar 

  4. A. A. Bakaev, S. V. Branovitskaya, and N. Z. Shor, “Methodology and experience with large transportation networks solved by computer,” in: Mathematical Methods and Problems of Production [in Russian], Moscow (1963), pp. 247–257.

  5. V. D. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and solution methods,” Kibernetika, No. 1, 89–102 (1972).

    Google Scholar 

  6. V. L. Volkovich and L. F. Dargeiko, “Methods of constraints in vector optimization problems,” Avtomatika, No. 3, 13–17 (1976).

    Google Scholar 

  7. V. L. Volkovich and A. F. Voloshin, “A version of the method of sequential analysis and exclusion of alternatives,” Kibernetika, No. 5, 98–105 (1978).

    Google Scholar 

  8. V. L. Volkovich and V. M. Voinalovich, “A man-machine procedure for solving multicriterial optimization problems,” Usp. Sist. Mash., No. 5, 24–28 (1979).

    Google Scholar 

  9. A. A. Gaivoronskii, Investigation of Nonstationary Stochastic Programming Problems [in Russian], Author's Abstract of Candidate's Thesis, Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1979).

    Google Scholar 

  10. V. I. Gershovich, “A cutting-plane method using linear transformations of spaces,” in: Optimal Decision Theory [in Russian], Kiev (1979), pp. 15–23.

  11. V. M. Glushkov, “A method of automatic programming,” in: Problems of Cybernetics [in Russian], Moscow (1959), pp. 181–184.

  12. V. M. Glushkov and G. B. Oleyarsh, “An interactive planning system DISPLAN,” Usp. Sist. Mash., No. 4, 123–124 (1976).

    Google Scholar 

  13. V. M. Glushkov, Yu. V. Kapitonova, M. F. Kaspshitskaya, and I. V. Sergienko, “Algorithmic software of the program package VEKTOR-1,” Kibernetika, No. 4, 1–5 (1978).

    Google Scholar 

  14. V. M. Glushkov, M. F. Kaspshitskaya, and I. V. Sergienko, “Problems of formalization and solution of one class of discrete optimization problems,” Zh. Vychisl. Mat. Mat. Fiz.,20, No. 6, 1384–1400 (1980).

    Google Scholar 

  15. V. M. Glushkov, “On system optimization,” Kibernetika, No. 5, 89–90 (1980).

    Google Scholar 

  16. V. M. Glushkov, V. V. Ivanov, V. S. Mikhalevich, I. V. Sergienko, and A. A. Stognii, Computation Optimization Reserves [in Russian], Preprint Inst. Kibernet. Akad. Nauk UkrSSR, No. 77-67 (1977).

  17. V. M. Glushkov, V. S. Mikhalevich, and T. P. Podchasova, “Multilevel management systems for an industrial enterprise in the organization-program package ÉTAP,” Usp. Sist. Mash., No. 3, 3–7 (1980).

    Google Scholar 

  18. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Software for automatic computer and system design system (PROEKT),” Kibernetika, No. 4, 1–6 (1970).

    Google Scholar 

  19. V. M. Glushkov, A. I. Nikitin, and I. V. Sergienko, “Problems of operating management of the galvanic coating process,” in: Congress IFIP, Toronto, 1977, Amsterdam (1977), pp. 256–267.

  20. O. V. Glushkova and A. I. Gupal, “Numerical methods for minimizing a function of maximum without computation of gradients,” Kibernetika, No. 5, 141–143 (1980).

    Google Scholar 

  21. A. A. Dorodnitsyn, M. F. Kaspshitskaya, and I. V. Sergienko, “An approach to formalization of classification,” Kibernetika, No. 6, 132–140 (1976).

    Google Scholar 

  22. L. F. Gulyanitskii, “On some functional notions in discrete spaces,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 10, 870–873 (1978).

    Google Scholar 

  23. A. M. Gupal, Stochastic Methods for Solution of Nonsmooth Extremal Problems [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  24. V. F. Dem'yanov and V. N. Malozemov, Introduction to Minimax [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  25. S. V. Yablonskii and O. B. Lupanova (eds.), Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  26. Yu. G. Evtushenko, “An interactive optimization system,” in: Optimization Methods [in Russian], Moscow (1978), pp. 301–346.

  27. V. A. Emelichev, “Discrete optimization. Sequential solution methods. Parts 1–2,” Kibernetika, No. 6, 109–111 (1971); No. 2, 92–103 (1972).

    Google Scholar 

  28. I. I. Eremin, “On method of ‘penalties’ in convex programming,” Dokl. Akad. Nauk SSSR,173, No. 4, 63–67 (1967).

    Google Scholar 

  29. Yu. M. Ermol'ev, “Methods of solution of nonlinear extremal problems,” Kibernetika, No. 4, 1–17 (1966).

    Google Scholar 

  30. Yu. M. Ermol'ev and N. Z. Shor, “On minimization of nondifferentiable functions,” Kibernetika, No. 7, 101–102 (1967).

    Google Scholar 

  31. Yu. M. Ermol'ev and N. Z. Shor, “Random search method for two-stage stochastic programming problems and its generalization,” Kibernetika, No. 1, 90–92 (1968).

    Google Scholar 

  32. Yu. M. Ermol'ev and Z. V. Nekrylova, “On some methods of stochastic optimization,” Kibernetika, No. 6, 96–98 (1966).

    Google Scholar 

  33. Yu. M. Ermol'ev and Z. V. Nekrylova, “Stochastic gradient method and its application,” Teor. Optimal. Resh., No. 1, 22–28 (1968).

    Google Scholar 

  34. Yu. M. Ermol'ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  35. Yu. M. Ermol'ev, V. P. Gulenko, and T. I. Tsarenko, Finite Differences in Optimal Control Problems [in Russian], Naukova Dumka, Kiev (1978).

    Google Scholar 

  36. A. A. Zhelikhovskii, “Organization principles of the interactive system PIONER,” Kibernetika, No. 5, 61–65 (1978).

    Google Scholar 

  37. Yu. I. Zhuravlev and Yu. Yu. Finkel'shtein, “Applications of discrete programming methods,” in: Application of Operations Research in Economics [in Russian], Moscow (1977), pp. 29–69.

  38. G. N. Zhurbenko, Investigation of a Class of Minimization Algorithms for Nonsmooth Problems and Their Application to Solution of Large Problems [in Russian], Author's Abstract of Candidate's Thesis, Kiev (1977).

  39. V. V. Ivanov, “Some algorithms for nonlinear programming problems,” in: Proc. Seminar on Automation of Production Processes [in Russian], DNTP, Kiev (1963), pp. 24–26.

    Google Scholar 

  40. V. V. Ivanov and V. A. Lyudvichenko, “A method of sequential unconstrained minimization for solution of mathematical programming problems,” Kibernetika, No. 2, 1–8 (1977).

    Google Scholar 

  41. V. V. Ivanov, V. A. Lyudvichenko, V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Problems of Increasing the Efficiency of Algorithms for Minimization of Functions and Mathematical Programming [in Russian], Preprint Inst. Kibernet. Akad. Nauk UkrSSR, No. 79-59, Kiev (1979).

  42. Yu. M. Kaniovskii, P. S. Knopov, and Z. V. Nekrylova, Limit Theorems for Stochastic Programming Processes [in Russian], Naukova Dumka, Kiev (1980).

    Google Scholar 

  43. M. K. Kozlov, S. P. Tarasov, and L. G. Khachiyan, “Polynomial solvability of convex quadratic programming,” Dokl. Akad. Nauk SSSR,248, No. 5, 1049–1051 (1979).

    Google Scholar 

  44. L. N. Kozeratskaya, “On systems of linear Diophantine equations with parameter,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 9, 11–14 (1980).

    Google Scholar 

  45. A. I. Kuksa and N. Z. Shor, “On a method of estimating the number of conditionally optimal trajectories of separable dynamic programming,” Kibernetika, No. 6, 37–44 (1972).

    Google Scholar 

  46. S. S. Lebedev, “Integer programming and Lagrange multipliers,” Ekonom. Matem. Metody,10, No. 3, 592–610 (1974).

    Google Scholar 

  47. V. K. Leont'ev, “Discrete extremal problems,” Itogi Nauki Tekh., Ser. Teor. Veroyatn., Mat. Statist., Teor. Kibern., No. 16, 39–101 (1979).

    Google Scholar 

  48. N. N. Moiseev, Numerical Methods in Optimal System Theory [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  49. V. S. Mikhalevich, “Bayesian choice between two hypotheses concerning the mean of a normal process,” Visn. Kiiv. Univ., No. 1, 101–104 (1958).

    Google Scholar 

  50. V. S. Mikhalevich, “Operations research and solution of multiple-alternative problems,” in: Proc. Math. Seminar [in Russian], No. 1, Lab. Ekon.-Mat. Metodov Akad. Nauk SSSR, Moscow (1962), pp. 1–14.

    Google Scholar 

  51. V. S. Mikhalevich and N. Z. Shor, “Method of sequential analysis of alternatives for solution of variational problems of management, planning, and design,” in: Proc. 4th Soviet Math. Congress, Leningrad (1961), p. 91.

  52. V. S. Mikhalevich and N. Z. Shor, “Numerical Solution of multiple-alternative problems by method of sequential analysis of alternatives,” in: Proc. Econ.-Math. Seminar [in Russian], No. 1, Lab. Ekon.-Mat. Metodov Akad. Nauk SSSR, Moscow (1962), pp. 15–42.

    Google Scholar 

  53. V. S. Mikhalevich and N. Z. Shor, Mathematical Topics of Optimal Plant Location [in Russian], Gosekon. Sovet SSSR, Lab. Mat. Metodov, Bulletin No. 2 (mimeographed), Moscow (1962).

  54. V. S. Mikhalevich, “Sequential optimization algorithms and their application. Parts 1–2,” Kibernetika, No. 1, 45–55 (1965); No. 2, 85–89 (1965).

    Google Scholar 

  55. V. S. Mikhalevich and N. Z. Shor, “The method of sequential analysis of alternatives for numerical solution of optimization problems,” in: Proc. on Application of Computers in National Economy, Gor'kii (1964), pp. 5–9.

  56. V. S. Mikhalevich, N. Z. Shor, and L. N. Bidulina, “Mathematical methods of choosing the optimal alternative for a gas pipeline with stationary gas flow conditions,” in: Economic Cybernetics and Operations Research [in Russian], Kiev (1967), pp. 57–59.

  57. V. S. Mikhalevich and V. V. Shkurba, “Sequential optimization schemes in job scheduling problems,” Kibernetika, No. 2, 34–40 (1966).

    Google Scholar 

  58. V. S. Mikhalevich, Yu. M. Ermol'ev, V. V. Shkurba, and N. Z. Shor, “Complex systems and solution of extremal problems,” Kibernetika, No. 5, 29–39 (1967).

    Google Scholar 

  59. V. S. Mikhalevich and V. L. Volkovich, “On some mathematical and heuristic features of complex design process,” Usp. Sist. Mash., No. 3, 3–9 (1976).

    Google Scholar 

  60. V. S. Mikhalevich, I. V. Sergienko, A. I. Kuksa, et al., “Results of experimental investigation of the efficiency of the methods included in the application package DISPRO,” Preprint, Institut Kibernet. Akad. Nauk UkrSSR, No. 80-47, Kiev (1980).

  61. V. S. Mikhalevich, N. Z. Shor, L. A. Galustova, et al., Computer Methods of Choosing Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1978).

    Google Scholar 

  62. A. S. Nemirovskii and D. B. Yudin, Complexity of Problems and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  63. E. A. Nurminskii, Numerical Methods for Solution of Deterministic and Stochastic Minimax Problems [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  64. T. P. Podchasova, V. M. Portugal, V. A. Tatarov, and V. V. Shkurba, Heuristic Scheduling Methods [in Russian], Tekhnika, Kiev (1980).

    Google Scholar 

  65. B. T. Polyak, “A general method for solution of extremal problems,” Dokl. Akad. Nauk SSSR,174, No. 1, 33–36 (1967).

    Google Scholar 

  66. B. T. Polyak, “Minimization of nonsmooth functionals,” Zh. Vych. Mat. Mat. Fiz.,1, No. 3, 509–521 (1961).

    Google Scholar 

  67. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods for Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  68. B. N. Pshenichnyi, Necessary Conditions for Extremum [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  69. B. N. Pshenichnyi, “Necessary conditions for extremum for differential inclusions,” Kibernetika, No. 6, 60–78 (1976).

    Google Scholar 

  70. B. N. Pshenichnyi, Convex Analysis and Extremal Problems [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  71. B. N. Pshenichnyi, “Structure of differential games,” Dokl. Akad. Nauk SSSR,184, No. 2, 285–287 (1969).

    Google Scholar 

  72. B. N. Pshenichnyi and M. I. Sagaidak, “On differential games with fixed time,” Kibernetika, No. 2, 54–63 (1970).

    Google Scholar 

  73. V. M. Selivonchik and V. V. Shkurba, “On solution of one class of problems in scheduling theory,” Kibernetika, No. 1, 91–96 (1981).

    Google Scholar 

  74. I. V. Sergienko, I. N. Parasyuk, and N. I. Tukalevskaya, Automatic Data Processing Systems [in Russian], Naukova Dumka, Kiev (1976).

    Google Scholar 

  75. I. V. Sergienko, M. F. Kaspshitskaya, V. I. Khil'chenko, L. F. Gulyanitskii, and A. I. Stiranka, “On program package VEKTOR-1 for solution of combinatorial optimization problems of one class,” in: Proc. Int. Conf. on Structure and Organization of Program Packages [in Russian], Tbilisi (1976), pp. 88–92.

  76. I. V. Sergienko, “H-method for solution of mixed-integer optimization problems,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 1, 75–78 (1981).

    Google Scholar 

  77. I. V. Sergienko, Design and Utilization of Optimization Software [in Russian], Preprint Inst. Kibernet. Akad. Nauk UkrSSR No. 79-38, Kiev (1979).

  78. I. V. Sergienko, T. T. Lebedeva, and V. A. Roshchin, Approximate Methods for Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1980).

    Google Scholar 

  79. I. V. Sergienko, “A method for solution of extremal problems,” Avtomatika, No. 5, 15–21 (1964).

    Google Scholar 

  80. I. V. Sergienko, “Developing an approach to solution of optimization problems in data processing systems and management information systems,” Usp. Sist. Mash., No. 6, 107–115 (1974).

    Google Scholar 

  81. I. V. Sergienko, “On application of the descent vector method to combinatorial optimization problems,” Usp. Sist. Mash., No. 2, 86–94 (1975).

    Google Scholar 

  82. I. V. Sergienko, “Application of the descent vector method to integer programming problems,” Usp. Sist. Mash., No. 3, 92–98 (1976).

    Google Scholar 

  83. V. A. Skokov, “A note on minimization methods using space stretching,” Kibernetika, No. 4, 115–117 (1974).

    Google Scholar 

  84. V. P. Soltan and P. S. Soltan, “D-convex functions,” Dokl. Akad. Nauk SSSR,219, No. 3, 555–558 (1979).

    Google Scholar 

  85. V. S. Tanaev and V. V. Shkurba, Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  86. V. A. Trubin, “A method for solution of specialized integer linear programming problems,” Dokl. Akad. Nauk SSSR,189, No. 5, 952–954 (1969).

    Google Scholar 

  87. V. A. Trubin and A. K. Gndoyan, “An algorithm and properties of the problem of synthesis of singlesource networks,” in: Theory of Optimal Decisions [in Russian], Kiev (1980), pp. 81–88.

  88. V. A. Trubin and B. M. Shumakov, “On unification and location problem,” in: Theory of Optimal Decisions [in Russian], Kiev (1979), pp. 69–75.

  89. V. A. Trubin, “An efficient algorithm for the problem of location in a tree network,” Dokl. Akad. Nauk SSSR,231, No. 3, 547–550 (1976).

    Google Scholar 

  90. V. A. Trubin, “On some location problems,” in: Application of Mathematical Methods in Economic Research and Planning [in Russian], No. 1, Kiev (1968), pp. 3–15.

  91. A. P. Uzdemir, “A successive decomposition scheme in optimization problems,” Avtom. Telemekh., No. 11, 94–105 (1980).

    Google Scholar 

  92. L. G. Khachiyan, “A polynomial algorithm of linear programming,” Dokl. akad. Nauk SSSR,244, No. 5, 1093–1096 (1979).

    Google Scholar 

  93. V. V. Shkurba, T. P. Podchasova, A. N. Pshichuk, and D. P. Tur, Scheduling Problems and Methods of Their Solution [in Russian], Naukova Dumka, Kiev (1966).

    Google Scholar 

  94. V. V. Shkurba, T. A. Podchasova, N. Ya. Penner, and V. N. Savitskii, “Investigation of efficiency of some preference functions in scheduling problems,” in: System Engineering [in Russian], Kiev (1971), pp. 79–96.

  95. V. V. Shkurba, “Succession intervals in ordering problems,” Kibernetika, No. 2, 77–79 (1970).

    Google Scholar 

  96. V. V. Shkurba, “Computational schemes for solution of scheduling problems,” Kibernetika, No. 3, 72–76 (1965).

    Google Scholar 

  97. V. V. Shkurba, E. A. Finn, and L. N. Komzakova, Planning the Agricultural Machinery Pool of Agricultural Enterprises [in Russian], Naukova Dumka, Kiev (1966).

    Google Scholar 

  98. V. V. Shkurba, V. A. Boldyreva, et al., Batch Production Planning by MIS [in Russian], Tekhnika, Kiev (1975).

    Google Scholar 

  99. N. Z. Shor, “Application of the gradient descent method to network transportation problem,” in: Proc. Scientific Seminar on Theoretical and Applied Topics in Cybernetics and Operations Research, Scientific Council of Cybernetics, Ukrainian Academy of Sciences [in Russian], No. 1, Kiev (1962), pp. 9–17.

  100. N. Z. Shor, “Application of generalized gradient descent in block programming,” Kibernetika, No. 3, 53–55 (1967).

    Google Scholar 

  101. N. Z. Shor, “On speed of convergence of generalized gradient descent,” Kibernetika, No. 3, 98–99 (1968).

    Google Scholar 

  102. N. Z. Shor and M. B. Shchepakin, “Algorithm for two-stage stochastic programming problem,” Kibernetika, No. 3, 56–58 (1968).

    Google Scholar 

  103. N. Z. Shor, “Space stretching transformations in minimization of convex functions,” Kibernetika, No. 1, 6–12 (1970).

    Google Scholar 

  104. N. Z. Shor, “On speed of convergence of the generalized gradient descent method with space stretching,” Kibernetika, No. 2, 80–85 (1970).

    Google Scholar 

  105. N. Z. Shor and N. G. Zhurbenko, “A minimization method using space stretching in the direction of the difference of two successive gradients,” Kibernetika, No. 3, 51–59 (1971).

    Google Scholar 

  106. N. Z. Shor, “On minimization of almost differentiable functions,” Kibernetika, No. 4, 65–70 (1972).

    Google Scholar 

  107. N. Z. Shor, “Cutting-plane method with space stretching,” Kibernetika, No. 1, 94–95 (1977).

    Google Scholar 

  108. N. Z. Shor, Methods of Minimization of Nondifferentiable Functions and Their Application [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  109. N. Z. Shor and V. I. Gershovich, “On a family of algorithms for convex programming problems,” Kibernetika, No. 4, 62–67 (1979).

    Google Scholar 

  110. D. B. Yudin and A. S. Nemirovskii, “Information complexity and efficient methods of solution of extremal problems,” Ékon. Mat. Metody,12, No. 2, 357–369 (1976).

    Google Scholar 

  111. M. Held and R. Karp, “The traveling salesman problem and minimum spanning trees. 2,” Math. Program.,1, No. 1, 6–25 (1971).

    Google Scholar 

  112. M. Held, P. Wolfe, and H. Crowder, “Validation of subgradient optimization,” Math. Program.,6, No. 1, 62–88 (1974).

    Google Scholar 

  113. M. L. Balinski and P. Wolfe (eds.), Mathematical Programming, Study 3: Nondifferentiable Optimization, North-Holland, Amsterdam (1975).

    Google Scholar 

  114. V. S. Mikhalevich, “Sequential algorithms of optimization and their applications,” in: Proc. IFIP Congr., London, 1965, No. 1, Amsterdam (1965), p. 165.

  115. V. S. Mikhalevich, “The method of sequential analysis of variants for determination of optimal solution,” in: Proc. IFIP Congr., Amsterdam, 1962 (1963), pp. 177–179.

  116. C. Lemarechal and P. Mifflin, “Nonsmooth optimization,” in: Proc. Int. Inst. Applied Systems Analysis Workshop, Pergamon Press, New York (1977).

    Google Scholar 

  117. B. N. Pshenichnyi (Pshenichnij), “Lecon sur les jeux differentiels,” in: Control Optimal et Jeux Differentiels, No. 1, Paris (1971), pp. 145–226.

  118. B. N. Pshenichnyi (Pshenichnij), “ε-strategies in differential games,” in: Topics in Differential Games, Amsterdam (1973), pp. 45–98.

  119. P. Wolfe, A Bibliography for Ellipsoid Algorithm, Res. Rep. RC-8237, IBM Thomas J. Watson Res. Center, New York (1980).

    Google Scholar 

Download references

Authors
  1. V. S. Mikhalevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Sergienko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. Z. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 89–113, July–August, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikhalevich, V.S., Sergienko, I.V. & Shor, N.Z. Investigation of optimization methods and their applications. Cybern Syst Anal 17, 522–548 (1981). https://doi.org/10.1007/BF01082482

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation