×

Some directions and results of research in mathematical programming and system analysis. (English. Russian original) Zbl 0849.90127

Cybern. Syst. Anal. 31, No. 3, 317-349 (1995); translation from Kibern. Sist. Anal. 1995, No. 3, 3-48 (1995).
Summary: This article reviews the research in informatics, optimization theory, and system analysis associated with the scientific interests of our well-known scientist and mathematician, V. S. Mikhalevich, and his closest students and followers. We should qualify at the outset that the article does not review the full body of work of Mikhalevich, and certainly not of all his students: their work is much too extensive and much too multifaceted for one survey article. Moreover, in optimization theory, for instance, the Kiev mathematical school includes directions represented by other widely known scientists, and again these are not treated in the present article. I have decided to focus only on the studies and the directions of research to which V. S. Mikhalevich attached particular significance, which to a certain extent characterize his scientific creativity, and which are widely acknowledged among experts in our country and abroad.
The active development of research in mathematical programming and system analysis at the National Academy of Sciences of Ukraine began in the later 1950s and early 1960s, when the Computational Center of the Academy of Sciences of the Ukrainian SSR and a number of other scientific organizations in the country focused on the creation of new computers and computer software. At that time, Academician V. M. Glushkov organized in Kiev a number of scientific seminars, which served as a starting point for studies in optimization theory, modeling of production processes, and computer-aided design of complex objects. Glushkov was apparently among the first cybernetics who called attention to the need for the development of methods of system analysis, whose application in conjunction with modern computers to the study of complex processes in economics, medicine, engineering, and military science might achieve the desired goals. At that time, Mikhalevich himself, as well as his students and followers, were beginning their systematic work in this field. Their work was typically motivated by practical needs, and therefore immediately found wide applications for the solution of real-life problems.
The studies reviewed in this article can be classified into three main groups: (a) development and application of numerical optimization methods; (b) informatization of society and issues of economic cybernetics; (c) development of multiprocessor computers and computer software.

MSC:

90C99 Mathematical programming
01A72 Schools of mathematics
01A65 Development of contemporary mathematics

Software:

DISNEL; PLANNER; DISPRO
Full Text: DOI

References:

[1] B. V. Gnedenko and V. S. Mikhalevich, ”On the distribution of the number of crossings of two empirical distribution functions”, Dokl. Akad. Nauk SSSR,82, No. 6, 841–843 (1951).
[2] B. V. Gnedenko and V. S. Mikhalevich, ”Two theorems on the behavior of empirical distribution functions”, Dokl. Akad. Nauk SSSR,85, No. 1, 25–27 (1952). · Zbl 0047.12203
[3] V. S. Mikhalevich, ”On relative location of two empirical distribution functions”, Dokl. Akad. Nauk SSSR,85, No. 3, 485–488 (1952).
[4] V. S. Mikhalevich, ”Bayesian decisions and optimal methods of statistical acceptance control”, Ukr. Matem. Zh., 7, No. 4, 454–459 (1956).
[5] V. S. Mikhalevich, ”Sequential Bayesian decisions and optimal methods of acceptance control,” Teor. Veroyatn. Ee Primen.,1, No. 4, 395–421 (1956). · Zbl 0099.13302
[6] A. Wald, Sequential Analysis [Russian translation], Fizmatgiz, Moscow (1960). · Zbl 0091.14602
[7] R. Bellman, Dynamic Programming [Russian translation], IL, Moscow (1960).
[8] V. S. Mikhalevich, Sequential Bayesian Decisions and Optimal Methods of Statistical Acceptance Control, Abstract of Thesis [in Russian], Moscow (1956).
[9] V. S. Mikhalevich, ”Bayesian decision between two hypotheses regarding the mean value of a normal process,” Visn. Kiiv. Univ.,1, No. 1, 101–104 (1958).
[10] A. N. Shiryaev, ”Sequential analysis and controlled stochastic processes (discrete time),” Kibernetika, No. 3, 1–24 (1965).
[11] V. S. Mikhalevich, ”Sequential optimization algorithms and their application. A sequential search scheme,” Kibernetika, No. 1, 45–55 (1965). · Zbl 0204.19502
[12] V. S. Mikhalevich and N. Z. Shor, ”A method of sequential analysis of alternatives for solving variational problems of control, planning, and design,” Paper at 4th All-Union Mathematical Congress, Leningrad (1961).
[13] V. S. Mikhalevich and N. Z. Shor, ”Numerical solution of multialternative problems by the method of sequential analysis of alternatives,” Nauchno-Metodicheskia Materialy Ekonomiko-Matematicheskogo Seminara, AN SSSR and LEMI, No. 1, Mimeo, Moscow (1962).
[14] V. M. Glushkov, V. S. Mikhalevich, A. N. Sibirko, et al., ”Application of digital computers in railroad design,” Trudy TsNIIS i IK AN UkrSSR, Moscow, No. 51 (1964).
[15] V. S. Mikhalevich and N. Z. Shor, ”Mathematical foundations for the solution of problems of choosing the optimal longitudinal profile,” Trudy VNII Transport. Stroit., Moscow (1964), pp. 22–28.
[16] V. S. Mikhalevich, N. Z. Shor, and L. M. Bidulina, ”Mathematical methods of choosing the optimal alternative for a complex gas pipeline with stationary gas flow,” in: Economic Cybernetics and Operations Research [in Russian], Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1967), pp. 57–59.
[17] O. O. Bakaev, S. V. Branovitskaya, V. S. Mikhalevich, and N. Z. Shor, ”Determination of characteristics of a transportation network by the method of sequential analysis of alternatives,” Dopov. AN URSR, No. 4, 472–474 (1962).
[18] V. A. Trubin, ”On solution of integer linear programming problems of a special type”, Dokl. Akad. Nauk SSSR,189, No. 5, 552–554 (1969). · Zbl 0209.51201
[19] V. S. Mikhalevich and V. V. Shkurba, ”Sequential optimization schemes in job sequencing problems,” Kibernetika, No. 2, 34–44 (1966).
[20] N. N. Moiseev, Numerical Methods in Optimal System Theory [in Russian], Nauka, Moscow (1971). · Zbl 0234.35026
[21] V. S. Tanaev and V. V. Shkurba, An Introduction to the Theory of Schedules [in Russian], Nauka, Moscow (1975).
[22] V. A. Emelichev and V. I. Komlik, A Method for Construction of Sequential Plans for Solving Discrete Optimization Problems [in Russian], Nauka, Moscow (1981).
[23] V. S. Mikhalevich ”Sequential optimization algorithms and their application,” Kibernetika, No. 2, 85–89 (1965) · Zbl 0204.19502
[24] V. S. Mikhalevich (ed.), Computer Methods of Choosing Optimal Design Solutions [in Russian], Naukova Dumka, Kiev (1977).
[25] V. S. Mikhalevich and V. L. Volkovich, Computer Methods for Analysis and Design of Complex Systems [in Russian], Nauka, Moscow (1982). · Zbl 0548.93002
[26] V. I. Artemenko, ”On two approaches to approximate solution of mixed integer linear programming problems,” in: Computational Aspects in Application Software Packages [in Russian], Inst. Kibern. AN UkrSSR, Kiev (1980), pp. 15–25.
[27] V. S. Mikhalevich, V. L. Volkovich, A. F. Voloshin, and S. O. Mashchenko, ”Sequential approach to solution of mixed linear programming problems,” Kibernetika, No. 1, 34–40 (1983). · Zbl 0545.90078
[28] N. Z. Shor, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979). · Zbl 0524.49002
[29] N. Z. Shor, ”Application of the gradient descent method to solve the network transportation problem,” Proc. Sci. Seminar on Theoretical and Applied Issues of Cybernetics and Operations Research [in Russian], Sci. Council on Cybernetics of Ukr. Acad. Sci., No. 1, Kiev (1962), pp. 9–17.
[30] N. Z. Shor and G. I. Gorbach, ”Solution of allocation problems by the generalized gradient descent method,” Teoriya Optimal’nykh Reshenii, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev, No. 1, 59–71 (1968).
[31] V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems in Production–Transportation Planning [in Russian], Nauka, Moscow (1986). · Zbl 0701.90025
[32] Yu. M. Ermol’ev, ”Methods of solution of nonlinear extremal problems,” Kibernetika, No. 4, 1–17 (1966).
[33] B. T. Polyak, ”Minimization of nonsmooth functionals,” Vychislit. Matem. Matem. Fiz.,1, No. 3, 509–521 (1969).
[34] B. N. Pshenichnyi, Necessary Conditions of Extremum [in Russian], Nauka, Moscow (1969). · Zbl 0764.90079
[35] B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).
[36] I. I. Eremin and N. N. Astaf’ev, An Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).
[37] I. I. Eremin, ”On the ’penalty’ method in convex programming,” Kibernetika, No. 4, 63–67 (1967). · Zbl 0178.22702
[38] R. Rockafellar, Convex Analysis [Russian translation], Mir, Moscow (1973). · Zbl 0251.90035
[39] V. F. Dem’yanov and L. V. Vasil’ev, Nondifferentiable Optimization [in Russian], Nauka, Moscow (1981).
[40] M. L. Balinski and Ph. Wolfe (eds.), Mathematical Programming, Study 3, North-Holland, Amsterdam (1975). · Zbl 0374.90063
[41] N. Z. Shor, ”The use of space stretching operations for minimization of convex functions,” Kibernetika, No. 1, 6–12 (1970).
[42] N. Z. Shor and N. G. Zhurbenko, ”Minimization method using the operation of space stretching in the direction of the difference of two successive gradients,” Kibernetika, No. 3, 51–59 (1971). · Zbl 0272.90071
[43] N. Z. Shor and L. P. Shabashova, ”Solving minmax problems by the method of generalized gradient descent with space stretching,” Kibernetika, No. 1, 82–88 (1972). · Zbl 0234.90053
[44] A. S. Nemirovskii and D. B. Yudin, Complexity of Problems and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).
[45] N. Z. Shor, ”Cutting plane method with space stretching for convex programming problems,” Kibernetika, No. 1, 94–95 (1977).
[46] L. T. Khachiyan, ”Polynomial-time algorithms in linear programming,” Dokl. Akad. Nauk UkrSSR,244, No. 5, 1093–1095 (1979). · Zbl 0414.90086
[47] V. I. Gershovich, ”On rate of convergence of the ellipsoid algorithm for minimization of convex functions,” in: Soffware for Extremal Problems and Application Packages [in Russian], Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1982), pp. 37–42.
[48] I. A. Vdovichenko, V. A. Trubin, N. Z. Shor, and G. N. Yun, ”Problems of standardization of technical objects,” Kibernetika, No. 6, 106–108 (1974).
[49] V. S. Mikhalevich and G. N. Yun, ”Optimization of main design parameters of passenger aircraft,” Visn. AN USSR, No. 8, 39–43 (1981).
[50] V. S. Mikhalevich, R. V. Sakach, O. N. Titkov, and G. N. Yun, Mathematical Models of Programmed Planning of Civil Aviation Development [in Russian], Preprint 76-35, Inst. Kibern. AN UkrSSR, Kiev (1976).
[51] N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
[52] N. Z. Shor and O. A. Berezovski, ”New algorithms for constructing optimal circumscribed and inscribed ellipsoids,” Optimization Methods and Software,1, 283–299 (1992). · doi:10.1080/10556789208805527
[53] N. Z. Shor and D. I. Solomon, Decomposition Methods in Fractional-Linear Programming, Shtiintsa, Kishenev (1989). · Zbl 0713.90044
[54] N. Z. Shor, ”An approach to finding global extrema in polynomial problems of mathematical programming,” Kibernetika, No. 5, 102–106 (1987). · Zbl 0654.90076
[55] N. Z. Shor, ”A class of global minimum bounds for polynomial functions,” Kibernetika, No. 6, 9–11 (1987). · Zbl 0648.90058
[56] N. Z. Shor, ”Dual estimates in multiextremal problems,” J. Global Optimization,2, 411–418 (1992). · Zbl 0765.90072 · doi:10.1007/BF00122430
[57] A. M. Gupal, Stochastic Methods of Nonsmooth Optimization [in Russian], Naukova Dumka, Kiev (1979).
[58] V. S. Mikhalevich, A. M. Gupal, and V. I. Norkin, Methods of Nonconvex Optimization [in Russian], Nauka, Moscow (1987). · Zbl 0635.90054
[59] First All-Union Conf. on Mathematical Issues of Network Scheduling and Control, abstracts and papers [in Russian], AN UkrSSR, Kiev (1967).
[60] V. V. Shkurba, E. P. Podchasova, F. N. Pshichuk, and L. P. Tur, Scheduling Problems and Solution Methods [in Russian], Naukova Dumka, Kiev (1966).
[61] V. V. Shkurba, V. V. Boldyreva, A. F. V’yun, K. F. Efetova, V. A. Leshchenko, T. P. Podchasova, and L. P. Tur, Discrete Production Planning in MIS Environments [in Russian], Tekhnika, Kiev (1975).
[62] K. F. Efetova, T. P. Podchasova, V. M. Portugal, and V. E. Trinchuk, Production Planning in MIS Environments [in Russian], Tekhnika, Kiev (1984).
[63] T. P. Podchasova, V. M. Portugal, V. A. Tatarov, and V. V. Shkurba, Heuristic Scheduling Methods [in Russian], Terkhnika, Kiev (1980).
[64] T. P. Podchasova, A. P. Lagoda, and V. F. Rudnitskii, Control in Hierarchical Production Structures [in Russian], Naukova Dumka, Kiev (1989).
[65] I. V. Sergienko, ”Abstract formulation of one problem,” Dop. AN URSR, No. 2, 177–179 (1965).
[66] I. V. Sergienko, ”A method of solving extremal equations in one class of problems,” Dop. AN URSR, No. 3, 296–299 (1965).
[67] I. V. Sergienko, ”A method of solving one special problem of scheduling theory,” in: Algorithmic Languages and Computer-Aided Programming [in Russian], Naukova Dumka, Kiev (1965), pp. 54–62.
[68] V. S. Mikhalevich and A. I. Kuksa, Sequential Optimization Methods in Discrete Network Problems of Optimal Allocation of Resources [in Russian], Nauka, Moscow (1983). · Zbl 0516.90023
[69] I. V. Sergienko, ”A method of solving problems to find extremal values,”Avtomatika, No. 5, 15–21 (1964).
[70] Yu. I. Zhuravlev, ”A class of algorithms on finite sets,” Dokl. Akad. Nauk SSSR,151, No. 5, 1025–1028 (1963).
[71] Yu. I. Zhuravlev, ”Local algorithms for computation of information, I, II,” Kibernetika, No. 1, 12–19 (1965), No. 2, 1–11 (1966). · Zbl 0146.24702
[72] I. V. Sergienko, Mathematical Models and Methods of Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1988).
[73] I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods of Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981). · Zbl 0507.90050
[74] I. V. Sergienko, T. T. Lebedeva, and V. A. Roshchin, Approximate Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1980). · Zbl 0435.90064
[75] Yu. Yu. Finkel’shtein, Approximate Methods and Applied Problems in Discrete Programming [in Russian], Nauka, Moscow (1967).
[76] T. T. Lebedeva, I. V. Sergienko, and V. P. Soltan, ”More on conditions of identity of local and global extrema in discrete optimization problems,” Kibern. Sist. Anal., No. 5, 68–78 (1993). · Zbl 0824.90099
[77] V. A. Trubin, ”Dynamic decomposition method for linear programming problems with generalized upper bounds,” Kibernetika, No. 4, 49–53 (1986). · Zbl 0636.90055
[78] V. A. Trubin, ”Effective algorithm for solving location problems on a tree like network,”Dokl. Akad. Nauk SSSR, 82318, No. 3, 547–550 (1976).
[79] V. A. Trubin, ”Network homogeneity defect and its reduction,” Dokl. Akad. Nauk SSSR,318, No. 1, 43–47 (1991). · Zbl 0776.90066
[80] V. A. Trubin, ”Integer packing of trees and branchings,” Kibern. Sist. Anal., No. 1, 29–33 (1995). · Zbl 0840.05088
[81] I. M. Mel’nik, ”Maximal dynamic network flow,” Kibernetika, No. 1, 99–102 (1973).
[82] I. M. Mel’nik, ”Nonhomogeneous network transportation problem,” Kibernetika, No. 2, 69–72 (1978).
[83] V. A. Roshchin and I. V. Sergienko, ”A general approach to the solution of covering problem,” Kibernetika, No. 6, 65–69 (1984). · Zbl 0572.90073
[84] V. A. Roshchin and I. V. Sergienko, ”Application of the implicit enumeration method to solve the packing problem,” Kibern. Sist. Anal., No. 6, 19–22 (1993). · Zbl 0820.90076
[85] L. F. Gulyanitskii and S. A. Malyshko, A Combinatorial Approach to the Solution of a Class of Location Problems [in Russian], Preprint 88-32, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1988).
[86] A. N. Khodzinskii, ”A sequential algorithm for solving combinatorial optimization problems on permutations,” Kibernetika, No. 6, 55–75 (1985).
[87] A. A. Dorodnitsyn, M. F. Kaspshitskaya, and I. V. Sergienko, ”An approach to formalization of classification,” Kibernetika, No. 6, 132–140 (1976).
[88] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, ”Optimization by simulated annealing,” Science,220, No. 4598, 671–680 (1983). · Zbl 1225.90162 · doi:10.1126/science.220.4598.671
[89] L. F. Gulyanitskii, Solution of Quadratic Assignment Problems by Simulation Algorithms [in Russian], Preprint 91-45, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1991).
[90] L. F. Gulyanitskii, L. B. Koshlai, and I. V. Sergienko, ”Convergence of one simulation method for solving combinatorial optimization problems,” Kibern. Sist. Anal., No. 3, 164–167 (1993).
[91] I. V. Sergienko and V. P. Shilo, ”An approach to construction of approximate solutions of 0–1 linear programming problems,” Kibernetika, No. 1, 40–43 (1988). · Zbl 0671.90051
[92] I. V., Sergienko and V. P. Shilo, ”Probabilistic decomposition of 0–1 integer linear programming problems and automatic selection of solution algorithms,” Kibern. Sist. Anal., No. 2, 149–158 (1994). · Zbl 0838.90085
[93] Yu. Yu. Chervak, ”Search of a lexicographically maximal discretely defined point in a convex set,” Mat. Met. Resh. Ekon. Zadach,8, No. 6, 69–76 (1979). · Zbl 0435.90111
[94] Yu. Yu. Chervak, ”On existence conditions for solutions of lexicographic optimization problems,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 6, 65–71 (1982). · Zbl 0527.90092
[95] Yu. Yu. Chervak, ”Pareto-lexicographic optimization,” in: Infinite Groups and Adjacent Algebraic Structures [in Russian] (1993), pp. 538–546.
[96] V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, ”Decomposition approach to solving some integer programming problems with inexact data,” Zh. Vychisl. Matem. Mat. Fiz.,29, No. 5, 786–791 (1990). · Zbl 0706.90049
[97] M. F. Kaspshitskaya, I. V. Sergienko, and A. I. Stiranka, ”Some properties of discrete fuzzy sets,” Zh. Vychisl. Matem. Mat. Fiz.,29, No. 7, 1107–1112 (1990). · Zbl 0716.04003
[98] L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, ”Investigation of stability issues of discrete optimization problems,” Kibern. Sist. Anal., No. 3, 78–93 (1993). · Zbl 0829.90118
[99] E. G. Belousov and B. Bank (eds.), Mathematical Optimization: Issues of Solvability and Stability [in Russian], MGU, Moscow (1986).
[100] V. V. Podlinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multicriterion Problems [in Russian], Nauka, Moscow (1982).
[101] L. N. Kozeratskaya, ”Vector optimization problems: stability in the solution space and in the space of alternatives,” Kibern. Sist. Anal., No. 6, 122–134 (1994). · Zbl 0837.90107
[102] L. N. Kozeratskaya, T. T. Lebedeva, and T. I. Sergienko, ”Integer programming problems with a vector criterion: parametric analysis and stability analysis,” Dokl. Akad. Nauk SSSR,307, No. 3, 527–529 (1989). · Zbl 0695.90066
[103] V. S. Mikhalevich, I. V. Sergienko, T. T. Lebedeva, et al., ”DISPRO: an application software package for solving discrete programming problems,” Kibernetika, No. 3, 117–137 (1981).
[104] V. S. Mikhalevich, I. V. Sergienko, N. Z. Shor, et al., ”DISPRO-3 software package: purpose, classes of solvable problems, system programs and algorithms,” Kibernetika, No. 1, 56–71 (1985).
[105] V. S. Mikhalevich, I. V. Sergienko, N. Z. Shor, et al., ”DISNEL: an application software package for solving discrete and nonlinear optimization problems,” Kibernetika, No. 3, 36–45 (1991). · Zbl 0763.65044
[106] A. A. Samarskii, ”Mathematical modeling and computational experiment,” Vestnik AN SSSR, No. 5, 38–49 (1979).
[107] Yu. M. Ermol’ev and Z. V. Nekrylova, ”Stochastic subgradient method and its applications,” in: Optimal Decision Theory [in Russian], Vol. 1, Inst. Kibern. AN UkrSSR, Kiev, (1967), pp. 24–47.
[108] Yu. M. Ermol’ev and N. Z. Shor, ”Random search method for two-stage stochastic problems and its generalizations,” Kibernetika, No. 1, 90–92 (1968).
[109] Yu. M. Ermol’ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).
[110] A. A. Gaivoronskii, ”Nonstationary stochastic programming problems,” Kibernetika, No. 4, 89–92 (1978).
[111] Yu. M. Ermol’ev and A. I. Yastremskii, Stochastic Models and Methods in Economic Planning [in Russian], Nauka, Moscow (1979).
[112] E. A. Nurminskii, Numerical Methods of Solution of Deterministic and Stochastic Minmax Problems [in Russian], Naukova Dumka, Kiev (1979).
[113] Yu. Ermoliev and R. Wets (eds.), Numerical Techniques for Stochastic Optimization, Springer Series in Computation Mathematics, Vol. 10, Springer, Berlin (1988). · Zbl 0658.00020
[114] S. P. Uryas’ev, Adaptive Methods in Game Theory and Stochastic Programming [in Russian], Nauka, Moscow (1990).
[115] Yu. Ermoliev, V. Norkin, and R. Wets, ”On enumeration of discontinuous functions,” SIAM J. Contr. Optim., No. 1, 50–69 (1994).
[116] Yu. M. Kaniovskii, P. S. Knopov, and Z. V. Nekrylova, Limit Theorems for Stochastic Programming Processes [in Russian], Naukova Dumka, Kiev (1980). · Zbl 0447.62077
[117] A. N. Nakonechnyi, ”Probability-theoretical generalization of Lyapunov second method,” Kibern. Sist. Anal., No. 1, 73–86 (1993).
[118] Yu. M. Ermol’ev and V. S. Mikhalevich, Studies in Risk Analysis [in Russian], Preprint 91-19, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1991).
[119] V. S. Mikhalevich, P. S. Knopov, and A. N. Golodnikov, ”Mathematical models and methods of risk assessment in ecologically hazardous industries,” Kibern. Sist. Anal., No. 2, 121–129 (1994). · Zbl 0837.90030
[120] P. S. Knopov, Optimal Estimates of Parameters in Stochastic Systems [in Russian], Naukova Dumka, Kiev (1991). · Zbl 0834.60055
[121] Yu. M. Ermol’ev, V. P. Gulenko, and T. I. Tsarenko, Finite-Difference Method in Optimal Control Problems [in Russian], Naukova Dumka, Kiev (1978). · Zbl 0408.49037
[122] P. S. Knopov and E. N. Derieva, ”Control problem for diffusion type random fields,” Kibern. Sist. Anal., No. 1, 62–77 (1995). · Zbl 0844.93079
[123] E. I. Kasitskaya and P. S. Knopov, ”Asymptotic behavior of empirical estimates in stochastic programming problems,” Dokl. Akad. Nauk SSSR,315, No. 2, 279–281. · Zbl 1091.90058
[124] A. A. Chikrii, Conflict-Controlled Processes [in Russian], Naukova Dumka, Kiev (1992). · Zbl 1127.91310
[125] V. N. Zhukovskii and A. A. Chikrii, Linear-Quadratic Differential Games [in Russian], Naukova Dumka, Kiev (1994).
[126] A. A. Chikrii, ”Variable direction method in nonlinear differential pursuit-and-evasion games,” Kibernetika, No. 1, 48–54 (1984).
[127] A. A. Chikrii, ”A discrete search game with moving objects,” Dokl. Akad. Nauk UkrSSR, No. 10, 74–77 (1984).
[128] V. S. Mikhalevich, I. V. Sergienko, V. K. Zadiraka, and M. D. Babich, ”On optimization of computation,” Kibernetika, No. 2, 65–94 (1994). · Zbl 0835.65161
[129] V. S. Mikhalevich, Yu. M. Kanygin, and V. I. Gritsenko, Informatics. General Premises [in Russian], Preprint 83-31, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1983).
[130] V. S. Mikhalevich, Yu. M. Kanygin, and V. I. Gritsenko, ”Informatics – a new field of science and practice,” in: Cybernetics. The Establishment of Informatics [in Russian], Nauka, Moscow (1986), pp. 31–45.
[131] V. S. Mikhalevich, V. I. Skurikhin, Yu. M. Kanygin, and V. I. Grisenko, Some Approaches to the Conception of Informatization of Society [in Russian], Preprint 88-66, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1988).
[132] V. S. Mikhalevich, M. V. Mikhalevich, and I. V. Podolev, Modeling of Some Processes in Ukrainian Economy [in Russian], Preprint 93-46, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1993).
[133] V. S. Mikhalevich, M. V. Mikhalevich, and I. V. Podolev, Modeling of Some Mechanisms of Government Price Intervention in a Transition Economy [in Russian], Preprint 94-18, Inst. Kibern. im. V. M. GlushkovXA*p2175XUkrS Kiev (1994).
[134] V. S. Mikhalevich, A. A. Bakaev, V. I. Gritsenko, V. L. Revenko, and Yu. N. Kuznetsov, Information Technology in Transportation. Railroad Transport [in Russian], Naukova Dumka, Kiev (1991).
[135] A. A. Bakaev, V. I. Gritsenko, and V. L. Ravenko, Information Technology in Transportation. Water Transport [in Russian], Naukova Dumka, Kiev (1992).
[136] I. V. Sergienko, V. S. Deineka, and V. V. Skopetskii, ”Solution of nonlinear parabolic equations with discontinuity in convective transport terms,” Dop. AN Ukrainy, Ser. A, No. 9, 21–24 (1989). · Zbl 0693.65079
[137] I. V. Sergienko, V. V. Skopetskii, and V. S. Deineka, Mathematical Modeling and Analysis of Processes in Nonhomogeneous Media [in Russian], Naukova Dumka, Kiev (1991).
[138] I. V. Sergienko, V. V. Skopetskii, and V. S. Deineka, ”Some problems of computer-aided analysis of complex physical fields,” in: Application Software Packages [in Russian] Nauka, Moscow (1989), pp. 45–54. · Zbl 0850.76696
[139] V. S. Deineka, I. V. Sergienko, and V. V. Skopetskii, Mathematical Methods and Computation Methods for Problems with Discontinuous Solutions [in Russian], Naukova Dumka, Kiev (1995). · Zbl 0926.65083
[140] K. B. Polinkevich and Yu. N. Onopchuk, ”Conflict situations in regulating the main function of the respiratory system of the organism and mathematical models of their resolution,” Kibernetika, No. 3, 100–104 (1986).
[141] Yu. N. Onopchuk and D. I. Marchenko, ”Qualitative analysis of models of the respiratory system and control of its main function,” Kibernetika, No. 5, 110–114 (1984). · Zbl 0583.92010
[142] Yu. N. Onopchuk and D. I. Marchenko, ”Mathematical models of nitrogen saturation of the tissues of the human organism in case of hyperbaria,” Kibern. Vychisl. Tekhn., No. 63, 101–104 (1984).
[143] E. A. Akhlamov, D. I. Marchenko, and Yu. N. Onopchuk, ”Modeling of the gas-exchange function of respiratory modes of the lungs with natural ventilation,” Kibern. Vychisl. Tekhn., No. 78, 67–71 (1988).
[144] M. V. Bondarenko and Yu. N. Onopchuk, ”Mathematical aspects of the decompression problem,” in: Medical-Biological Topics in Decompression: Proc. 1 st All-Union Conf., Moscow, March 26–28, 1991 [in Russian], Inst. Med.-Biol. Problem, Moscow (1991), pp. 85–89.
[145] V. S. Mikhalevich, V. M. Janenko, and K. L. Atoev, ”System analysis of organism’s defensive functions regulation (MODFR),” in: Selected topics on Mathematical Models in Immunology and Medicine: Proc. Intern. Workshop, Kiev, Aug. 28-Sept. 7, 1989, IIASA, Luxenburg (1990), pp. 137–146.
[146] V. M. Janenko and K. L. Atoev, ”Mathematical simulation of the immunomodulating role of energy metabolism in support of synergism and antagonism of compartments of an immune system,” Acta Appl. Math.,14, 167–178 (1989). · Zbl 0677.92003 · doi:10.1007/BF00046683
[147] V. S. Mikhalevich, V. M. Yanenko, K. L. Atoev, et al., Mathematical Modeling of Regulatory Mechanisms of the Immune Systems Conditioned by Adenylic Acid 2’–5’ Oligonucleotides [in Russian], Preprint 90-47, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1990).
[148] V. S. Mikhalevich, V. M. Yanenko, and K. L. Atoev, ”The hierarchic mathematical model for risk estimation of ecological catastrophes,” Proc. Soc. for Risk Analysis, 1992 Annual Meeting, San Diego, Ca., December 6–9, 1992 (1992), pp. 1–4.
[149] V. S. Mikhalevich, V. M. Yanenko, and K. L. Atoev, ”An information system for risk assessment of ecological catastrophes,” in: Modeling and Control of the Functional State of the Organism [in Russian], Inst. Kibern. im. V. M. Glushkov AN Ukr., Kiev (1993), pp. 52–74.
[150] M. Z. Zgurovskii, Integrated Optimal Control and Design Systems [in Russian], Vishcha Shkola, Kiev (1990).
[151] M. Z. Zgurovskii, A. M. Demchenko, A. I. Novikov, and I. I. Kovalenko, System Analysis for the Study of Complex Physical Processes and Fields [in Russian], Preprint 93-30, Inst. Kibern. im. V. M. Glushkov AN Ukr., Kiev (1993).
[152] M. Z. Zgurovskii and A. I. Novikov, ”System analysis of stochastic parallelized processes,” in: Modeling, State Estimation, and Identification [in Russian], Kiev. Politekhn. Inst., Kiev (1988).
[153] J. Korbicz and M. S. Zgurovski, ”Estymacja i sterowanie stochastyczne ukladami o parametrach rozlozonych,” Wydawnictwo Naukowa PWN, Warsaw (1991).
[154] M. Z. Zgurovski and F. W. Ramirez, Control and Design Optimization for Industrial Systems, Vyshcha Shkola, Kiev (1990).
[155] B. N. Bublik, F. G. Garashchenko, and N. F. Kirichenko, Structural-Parametric Optimization and Stability of Beam Dynamics [in Russian], Naukova Dumka, Kiev (1985). · Zbl 0623.93064
[156] A. G. Nakonechnyi, Minmax Estimation of Functionals of Solutions of Variational Equations in Hilbert Spaces [in Russian], Naukova Dumka, Kiev (1985).
[157] S. I. Lyashko, ”A method to find an approximate solution of the hyperbolic Cauchy problem with operator coefficient,” Dokl. Akad. Nauk SSSR,247, No. 3, 546–549 (1979).
[158] S. I. Lyashko, ”On solvability of mixed boundary-value problems with operator coefficients,” Usp. Mat. Nauk.,255, No. 2, 191–192 (1987).
[159] S. I. Lyashko, ”Numerical methods of solution of optimal impulse control problems,” Zh. Vychisl. Matem. Mat. Fiz.,27, No. 43, 470–475 (1987). · Zbl 0623.65071
[160] A. M. Gupal, ”Inductive inference methods and their application in expert systems,” USiM, No. 7, 112–114 (1991).
[161] A. M. Gupal and A. M. Tsvetkov, ”Development of algorithms for inductive derivation of knowledge using decision leaves and trees,” USiM, No. 5/6, 21–26 (1992).
[162] V. S. Mikhalevich, I. V. Sergienko, V. A. Trubin, et al., ”PLANER: an application software package for solving large production-transportation planning problems,” Kibernetika, No. 3, 57–71 (1983).
[163] V. S. Mikhalevich, A. A. Bakaev, Yu. M. Ermol’ev, et al., A Software Package for Solving Transportation Problems. Solvable Problems, Features, and Source Language [in Russian], Preprint 81-40, Inst. Kibern. AN UkrSSR, Kiev (1981).
[164] V. S. Mikhalevich, Yu. M. Ermol’ev, V. T. Loskutov, et al., ”Description of a software package for nondifferentiable and stochastic optimization,” in: Operations Research and MIS [in Russian], No. 27, Vishcha Shkola, Kiev (1986), pp. 1–19.
[165] V. M. Glushkov and I. N. Molchanov, ”some issues of solving problems on a computer with parallel organization of computation,” Kibernetika, No. 4, 82–88 (1981).
[166] V. S. Mikhalevich and I. N. Molchanov, Trends in the Development of Supercomputers and Associated Problems [in Russian], Preprint 84-4, Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1984).
[167] I. N. Molchanov, ”Probleme der Parallelverarbeitung,” in: EdV Aspekte, Verlag die Wirtschaft, Berlin (1982), pp. 21–26.
[168] Numerical Methods for the ES Multiprocessor System [in Russian], VVIA im. N. E. Zhukovskii (1986).
[169] System Software for the ES Multiprocessor Computing System [in Russian], VVIA im. N. E. Zhukovskii (1986).
[170] I. N. Molchanov, An Introduction to Parallel Algorithms [in Russian], Naukova Dumka, Kiev (1990).
[171] A. Yu. Luchka, O. É. Noshchenko, and N. I. Tukalevskaya, ”Parallel organization of computation for solving linear equations by projection-iteration methods,” Kibernetika, No. 3, 38–47 (1984). · Zbl 0558.65021
[172] A. Yu. Luchka, O. É. Noshchenko, I. V. Sergienko, and N. I. Tukalevskaya, ”An accelerated conjugate gradient method,” Zh. Vychisl. Matem. Mat. Fiz.,27, No. 5, 651–660 (1987). · Zbl 0632.65065
[173] O. Dumberg and A. Migdalas, A Date Parallel Space Dilation Algorithm for the Concentrator Location Problem, Report LITH-MAT-R-1994-14, Linkoping Univ, Sweden (1994).
[174] V. S. Mikhalevich, Yu. V. Kapitonova, and A. A. Letichevskii, ”On methods of organization of macropipelined computation,” Kibernetika, No. 3, 3–10 (1986).
[175] A. A. Letichevsky, V. S. Mikhalevich, and J. V. Kapitonova, ”On models of macroconveyor computation,” Information Processing ’86, Proc. World IFIP Congr., Elsevier (1986).
[176] Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).
[177] V. S. Mikhalevich and I. N. Molchanov, Topics in Development of Parallel Computers [in Russian], Preprint 94-22, Inst. Kibern. im. V. M. Gluskhov NAN Ukr., Kiev (1994).
[178] V. S. Mikhalevich and V. M. Kuntsevich, An Approach to the Analysis of the Arms Level Control Process [in Russian], Inst. Kibern. im. V. M. Glushkov AN UkrSSR, Kiev (1989).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.