Skip to main content
SpringerLink
Log in

Irreducible System of Constraints for a General Polyhedron of Arrangements

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We construct a system of constraints for a general polyhedron of arrangements that does not contain superfluous inequalities. The derivation of an irreducible system enables one to substantially reduce the number of operations necessary for finding exact solutions of optimization problems on arrangements.

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. I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for the Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).

  2. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  3. H. Stoyan and O. O. Emets', Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Institute of System Investigations in Education, Kiev (1993).

  4. O. A. Emets, “Extremal properties of nondifferentiable convex functions on Euclidean sets of combinations with repetitions,” Ukr. Mat. Zh., 46, No. 6, 680–691 (1994).

    Google Scholar 

  5. O. O. Emets' and A. A. Roskladka, “On estimates of minima of criterion functions in optimization on combinations,” Ukr. Mat. Zh., 51, No. 8, 1118–1121 (1999).

    Google Scholar 

  6. O. O. Emets', L. M. Kolechkina, and S. I. Nedobachii, Investigation of Domains of Definition for Problems of Euclidean Combinatorial Optimization on Permutation Sets [in Ukrainian], Poltava Technical University, Poltava (1999).

  7. O. V. Roskladka, O. O. Yemets, S. I. Nedobachiy, “About the system of linear restrictions, which describe a general polyhedron of the arrangements,” in: Proceedings of the VIIIth International M. Kravchuk Conference (Kiev, May 2000), Kiev (2000), p. 354.

  8. O. O. Emets' and L. M. Kolechkina, “Optimization problems on permutations with linear-fractional objective function: Properties of the set of admissible solutions,” Ukr. Mat. Zh., 52, No. 12, 1630–1640 (2000).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poltava Polytechnic University, Poltava

    O. O. Emets', O. V. Roskladka & S. I. Nedobachii

Authors
  1. O. O. Emets'
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. V. Roskladka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. I. Nedobachii
    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

Emets', O.O., Roskladka, O.V. & Nedobachii, S.I. Irreducible System of Constraints for a General Polyhedron of Arrangements. Ukrainian Mathematical Journal 55, 1–12 (2003). https://doi.org/10.1023/A:1025060316418

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025060316418

Keywords

Search

Navigation