Skip to main content
Log in

Symbolic-numerical methods in discrete programming problems with logical constraints

  • Published:
Cybernetics Aims and scope

Abstract

We propose a new technique based on symbolic transformation of a system of logical constraints into a so-called singular parenthesized form and develop efficient numerical methods for contraction of the parenthesized form. A solution example is given and the results of program experiments are reported.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Literature Cited

  1. V. P. Sigorskii, Mathematics for Engineers [in Russian], Tekhnika, Kiev (1977).

    Google Scholar 

  2. G. I. Ankudinov, Structural Design of Complex Objects: Logical-Combinatorial Approach [in Russian], Leningrad State Univ. (1986).

  3. G. I. Ankudinov, “On one general approach to structural design of algorithms, devices, and systems,” Kibernetika, No. 1, 55–68 (1982).

    Google Scholar 

  4. V. S. Mikhalevich and V. L. Volkovich, Computational Methods of Analysis and Design of Complex Systems [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  5. V. L. Volkovich, A. F. Voloshin, T. M. Gorlova, et al., Methods and Algorithms for Computer-Aided Design of Complex Control Systems [in Russian], Naukova Dumka, Kiev (1984).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 51–55, May–June, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ankudinov, G.I. Symbolic-numerical methods in discrete programming problems with logical constraints. Cybern Syst Anal 25, 347–353 (1989). https://doi.org/10.1007/BF01069990

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation