Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

DISPRO: A discrete programming package

  • 19 Accesses

Conclusions

The DISPRO package is open for modification and further development. Its modular structure allows expansion of the source language, incorporation of new system and application modules, realization in the current version of an interface with DBMS and other application packages (e.g., report generator, matrix generator), synthesis of the package with PL/1 and FORTRAN IV programming systems.

The first version of DISPRO released in 1980 has successfully passed the requisite acceptance tests and is now officially part of the optimization packages supported by ES series computers. As outlined in this article, the package has tremendous possibilities for solving a wide range of discrete optimization problems. So far, certain classes of discrete programming problems could be solved by LP ASU [31], VEKTOR-1, the Z-system [58], and TsP [31] application packages. In addition, some packages have been developed in recent years for mathematical programming and operations research (DISPLAN, an interactive planning system [60]; PTP, optimization of transportation problems [58]; PMP, separable and parametric linear programming; DILOS, interactive system for unconstrained optimization, nonlinear programming, and optimal control; ORBITAL', unconstrained optimization and approximation [61]; NDO, nondifferentiable and stochastic optimization [62]; and other less known packages reviewed, in particular, in [58].

New optimization packages are currently being developed in response to increased demands for quality, efficiency, and applicability in various MIS and ADPS. The next version of the DISPRO package is being designed on the basis of the appropriate principles and requirements for modern method-oriented packages, including accumulation and analysis of package performance data (these data may be used to improve the package software and structure), large dimensionality of the relevant problems, operating reliability, commercial development of packages, and their usability in integrated data processing systems.

In conclusion, DISPRO was developed by the concerted effort of a large team. In particular, we should mention the contributions of Yu. M. Ermol'ev, V. L. Volkovich, A. I. Kuksa, Yu. Yu. Chervak, N. S. Podgorodetskaya, E. S. Karpinka, V. M. Sementsova, V. I. Artemenko, and other members of the team.

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

Literature Cited

  1. 1.

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

  2. 2.

    V. M. Glushkov, “An interactive method for solving optimization problems,” Kibernetika, No. 4, 2–6 (1975).

  3. 3.

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

  4. 4.

    V. S. Mikhalevich, I. V. Sergienko, V. N. Bykov, et al., The DISPRO Software for Discrete Programming Problems [in Russian], Preprint, Inst. Kibernet. Akad. Nauk UkrSSR, No. 79-3, Kiev (1979).

  5. 5.

    V. S. Mikhalevich, I. V. Sergienko, N. Z. Shor, et al., An Application Package for Discrete Optimization Problems (DISPRO) [in Russian], Kiev (1980).

  6. 6.

    R. E. Gomory, “Outline of an algorithm for integer solution to linear programs,” Bull. Am. Math. Soc.,64, No. 5, 275–278 (1958).

  7. 7.

    T. Hu, Integer Programming and Network Flows, Addison-Wesley, Reading, Mass. (1969).

  8. 8.

    A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econometrica,28, No. 3, 497–520 (1960).

  9. 9.

    A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).

  10. 10.

    J. E. Benders, “Partitioning procedures for solving mixed-variables programming problems,” Numer. Math.,4, No. 3, 238–252 (1962).

  11. 11.

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

  12. 12.

    V. S. Mikhalevich and N. Z. Shor, “Numerical solutions of multialternative problems by the method of successive evaluation of alternatives,” in: Proc. Math.-Econ. Seminar, LEMI Akad. Nauk SSSR [in Russian], No. 1, Moscow (1962), pp. 15–42.

  13. 13.

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

  14. 14.

    V. S. Mikhalevich and V. V. Shkurva, “Sequential optimization methods in scheduling problems,” Kibernetika, No. 2, 34–40 (1966).

  15. 15.

    R. Bellman, Dynamic Programming, Princeton Univ. Press (1957).

  16. 16.

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

  17. 17.

    O. K. Sheinman, “Duality and subadditivity of functions in integer programming,” Ekon. Matemat. Metody,16, No. 4, 808–810 (1980).

  18. 18.

    J. Edmonds, “Submodular functions, matroids and certain polyhedra,” in: Proc. Calgary Int. Conf. on Combinatorial Structures and Their Applications, New York (1970), pp. 69–87.

  19. 19.

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

  20. 20.

    G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).

  21. 21.

    J. Edmonds, “Maximum matching and a polyhedron with 0–1 vertices,” J. Res. Nat. Bureau of Standards,69B, No. 3, 125–130 (1965).

  22. 22.

    V. S. Mikhalevich (ed.), Computational Methods for Choosing Optimal Design Solutions [in Russian], Kiev (1977).

  23. 23.

    N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, New York (1975).

  24. 24.

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

  25. 25.

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

  26. 26.

    Yu. Yu. Finkel'shtein, Approximate Methods and Applied Problems of Discrete Programming [in Russian], Nauka, Moscow (1976).

  27. 27.

    M. R. Garey and D. S. Johnson, Computers and Intractibility, San Francisco (1979).

  28. 28.

    R. M. Karp, “Reducibility in combinatorial problems,” Kibern. Sbornik, No. 12, 16–36 (1975).

  29. 29.

    A. H. Rinnoy Kan, “Scheduling,” Ann. Discrete Math.,5, 423–426 (1979).

  30. 30.

    A. Land and S. Powel, “Computer codes for problems of integer programming,” Ann. Discrete Math.,5, 221–269 (1979).

  31. 31.

    B. Ya. Kuritskii (ed.), Application of Software Packages of Economic-Mathematical Methods in MIS [in Russian], Statistika, Moscow (1980).

  32. 32.

    Yu. Yu. Chervak, “A backtracking algorithm of the cutting-plane method and the branch-and-bound method,” Ekon. Mat. Metody,14, No. 5, 1002–1005 (1978).

  33. 33.

    I. V. Sergienko, “Developing one approach to solution of discrete optimization problems in data processing systems in MIS,” Usp. Sist. Mash., No. 6, 107–114 (1974).

  34. 34.

    T. T. Lebedeva and I. V. Sergienko, “The method of directional neighborhoods,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 8, 741–744 (1978).

  35. 35.

    V. N. Bykov and I. V. Sergienko, “A method of seeking a feasible solution in integer programming problems,” in: Structure and Organization of Program Packages [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1978), pp. 26–33.

  36. 36.

    V. I. Artemenko, “A geometrical approach to seeking initial approximations in integer programming problems,” in: Structure and Organization of Program Packages [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1978), pp. 50–62.

  37. 37.

    L. V. Sergienko, T. T. Lebedeva, and N. V. Filonenko, “An approximate solution of integer linear programming problems with a parameter in constraints,” in: Computational Aspects of Application Packages [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1980), pp. 3–16.

  38. 38.

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

  39. 39.

    E. Balas, “An additive algorithm for solving linear programs with 0–1 variables,” Oper. Res.,13, 517–546 (1965).

  40. 40.

    V. L. Volkovich and A. F. Voloshin, “One general scheme of the method of successive evaluation and fathoming of alternatives,” Kibernetika, No. 5, 98–105 (1978).

  41. 41.

    V. L. Beresnev, E. Kh. Gimadi, and V. T. Dement'ev, Extremal Standardization Problems [in Russian], Nauka, Novosibirsk (1978).

  42. 42.

    V. Yu. Kanorov and A. I. Kuksa, The Method of Successive Evaluation of Alternatives in the Discrete Problems of Allocation of Scarce Resources [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1971).

  43. 43.

    M. L. Fisher, “Optimal solution of scheduling problems using Lagrange multipliers. I,” Oper. Res.,21, No. 5, 1114–1127 (1973).

  44. 44.

    M. L. Fisher, “Optimal solution of scheduling problems using Lagrange multipliers. II,” Lecture Notes Econ. and Math. Syst.,86, 194–318 (1973).

  45. 45.

    A. I. Kuksa, “Bounds on the length of shortest schedules in the network planning problem with nonstorable resources,” in: Theory of Optimal Decisions [in Russian], Kiev (1975), pp. 24–34.

  46. 46.

    V. Ya. Nasekin, “An approach to allocation of machines to jobs,” in: Computerized Production Management Systems [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1979), pp. 39–49.

  47. 47.

    N. I. Tukalevskaya and O. E. Klyueva, “Problems of optimal allocation of software components in multilevel computer store,” in: Development of Mathematical and Technical Tools of MIS [in Russian], Inst. Kibernet. Akad. Nauk UkrSSR, Kiev (1978), pp. 44–51.

  48. 48.

    E. Balas and M. Padberg, “Set partitioning,” SIAM Review,18, No. 4, 710–760 (1976).

  49. 49.

    V. Ya. Nasekin, “A method of solving monotone integer programming problems,” Kibernetika, No. 5, 106–109 (1979).

  50. 51.

    V. A. Trubin, “On some location-type problems,” Primen. Mat. Metodov Ekon. Issled. Planir., No. 1, 3–20 (1968).

  51. 52.

    F. T. Mukhitdinov and V. A. Trubin, Long-Range Development and Location of the Wine Industry in the Uzbek SSR [in Russian], Preprint, Inst. Kibernet. Akad. Nauk UkrSSR, No. 78-76, Kiev (1978).

  52. 53.

    M. A. Efroymson and T. L. Ray, “A branch-bound algorithm for plant location,” Oper. Res.,14, No. 3, 361–368 (1966).

  53. 54.

    S. S. Lebedev and M. I. Kovalevskaya, “Lagrange multipliers in a simple location problem (theory and computational experiment),” in: Studies in Discrete Optimization [in Russian], Moscow (1976), pp. 170–178.

  54. 55.

    V. P. Cherenin and V. R. Khachaturov, “Solution by successive evaluation method of one class of plant location problems,” Ekon.-Matemat. Metody, No. 2, 279–290 (1965).

  55. 56.

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

  56. 57.

    B. G. Tamm and E. Kh. Tyugu, “Software packages,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 111–126 (1977).

  57. 58.

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

  58. 59.

    A. I. Kuksa and Yu. P. Laptin, “Dynamic programming in the shortest-schedule network problems,” Kibernetika, No. 1, 111–114 (1978).

  59. 60.

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

  60. 61.

    N. N. Moiseev (ed.), State of the Art in Operations Research [in Russian], Nauka, Moscow (1979).

  61. 62.

    V. G. Loskutov and A. M. Nosov, “Interactive features of the NDO package,” in: Stochastic Methods in Optimization Problems [in Russian], Preprint, Inst. Kibernet. Akad. Nauk UkrSSR, No. 80-20, Kiev (1980).

Download references

Additional information

Translated from Kibernetika, No. 3, pp. 117–137, May–June, 1981.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Mikhalevich, V.S., Sergienko, I.V., Lebedeva, T.T. et al. DISPRO: A discrete programming package. Cybern Syst Anal 17, 416–437 (1981). https://doi.org/10.1007/BF01068988

Download citation

Keywords

  • Nonlinear Programming
  • Application Package
  • Transportation Problem
  • Unconstrained Optimization
  • Acceptance Test