Funcrional and analytic representations of the total permutation

Authors

  • Оксана Сергеевна Пичугина Kharkiv National University of Radio Electronics 14 Nauki ave., Kharkiv, Ukraine, 61166, Ukraine https://orcid.org/0000-0002-7099-8967
  • Сергей Всеволодович Яковлев Kharkiv National University of Internal Affairs 27 50-th Anniversary of the USSR ave., Kharkiv, Ukraine, 61080, Ukraine https://orcid.org/0000-0001-6736-371X

DOI:

https://doi.org/10.15587/1729-4061.2016.58550

Keywords:

functional representation of a set, total permutation, permutation polyhedron, combinatorial optimization

Abstract

The study introduces the notion of a functional representation of a set of points in the Euclidean space, suggests a classification of such representations, as well as describes the polyhedral-surface and the surface-polyhedral approaches to the functional representations of the total permutation. The study proves the existence of both strict and non-strict functional representations of the set, suggests a number of strict representations that are based on the studied properties of the two classes of symmetric functions, and presents the visualization and analysis of strict representations of small permutation arrays.

The study uses total permutations to present a new continuous reformulation of nonlinear tasks, which allows devising exact and approximate optimization algorithms that have the following properties:(a) they are based on the method of penalty function and a modified Lagrange method, (b) they do not use restrictions on the permutation polyhedron, and (c) they can be combined with convex extensions of objective functions from the set to a CD.

The obtained strict representations form a framework for new continuous relaxations of the combinatorial set and its subsets. Consequently, they can be the basis for new optimization methods and algorithms of total permutations. The methods can be applied to numerous practical problems if they are formulated as nonlinear unconditional tasks on permutations and their generalizations.

Author Biographies

Оксана Сергеевна Пичугина, Kharkiv National University of Radio Electronics 14 Nauki ave., Kharkiv, Ukraine, 61166

Candidate of physical and mathematical sciences

Department of Applied Mathematics

Сергей Всеволодович Яковлев, Kharkiv National University of Internal Affairs 27 50-th Anniversary of the USSR ave., Kharkiv, Ukraine, 61080

Doctor of physical and mathematical sciences, professor

Department of IT and Protection of Information

References

  1. Stoyan, Y. G., Yakovlev, S. V. (1986). Mathematical models and optimization methods in Geometric Design. Kyiv: Naukova Dumka, 268.
  2. Stoyan, Y. G., Yemets’, O. (1993). Theory and methods of Euclidean combinatorial optimization. Kyiv: ISSE, 188.
  3. Yemelichev, V. A., Kovalëv, M. M., Kravtsov, M. K. (1984). Polytopes, graphs and optimisation. Cambridge University Press, Cambridge, 344.
  4. Elte, E. L. (1912). The semiregular polytopes of the hyperspaces. Gebroeders Hoitsema, Groningen, 136.
  5. Polytopes – combinatorics and computation. (2000). Birkhäuser Verlag, Basel, 225. doi: 10.1007/978-3-0348-8438-9
  6. Brualdi, R. A. (2006). Combinatorial matrix classes. Cambridge University Press, Cambridge, 544.
  7. Pichugina, O. S. (1996). The methods and algorithms for a solution of some problems of optimization on arrangements and combinations. Kharkiv State Technical University of Radioelectroncs, 169.
  8. Pardalos, P. M. (Ed.) (2000). Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Springer, 581. doi: 10.1007/978-1-4757-3145-3
  9. Papadimitriou, C. H., Steiglitz, K. (2013). Combinatorial Optimization: Algorithms and Complexity (Unabridged edition). Dover Publications, 512.
  10. Hillier, F. S., Appa, G., Pitsoulis, L., Williams, H. P., Pardalos, P. M., Prokopyev, O. A., Busygin S. (2006). Continuous Approaches for Solving Discrete Optimization Problems. In Handbook on Modelling for Discrete Optimization, 1–39.
  11. Balinski, M. L., Hoffman, A. J. (Eds.). (1978). Polyhedral Combinatorics: Dedicated to the Memory of D. R. Fulkerson. Elsevier Science Ltd, Amsterdam; New York, 242.
  12. Pulleyblank, W. R. (2012). Edmonds, matching and the birth of polyhedral combinatorics. In Documenta Mathematica, 181–197.
  13. Henk, M., Richter-Gebert, J., Ziegler, G. M. (1997). Basic properties of convex polytopes, In Handbook of Discrete and Computational Geometry. CRC Press Inc, FL, USA, 243–270.
  14. Postnikov, A. (2009). Permutohedra, Associahedra, and Beyond. IMRN: International Mathematics Research Notices, 2009 (6), 1026–1106. doi: 10.1093/imrn/rnn153
  15. Kosolap, A. I. (2013). The global optimization methods. Dnepropetrovsk: Education and Science, 316.
  16. Murray, W., Ng, K.-M. (2008). An algorithm for nonlinear optimization problems with binary variables. Computational Optimization and Application, 47 (2), 257–288. doi: 10.1007/s10589-008-9218-1
  17. Pichugina, O., Yakovlev, S. (2012). Polyhedral-spherical approach to solving some classes of Combinatorial Optimization problems. In Proceedings of the 6th International School-Seminar on Decision Theory, 152–153.
  18. Yemets, O. A., Nedobachii, S. I. (1998). The general permutation polytope: the irreducible system of linear constraints and the equations of all facets. Scientific news of NTUU "KPI", 1, 100–106.
  19. Stoyan, Y. G., Yakovlev, S. V., Parshin, O. V. (1991). Quadratic optimization on combinatorial sets in Rn. Cybernetics and Systems Analysis, 27 (4), 562–567.
  20. Gricik, V. V., Shevchenko, A. I., Kiseliova, O. M., Yakovlev, S. V. (2011). Mathematical methods of optimization and intellectual computer technologies of modeling of complex processes and systems with considering object space forms. Doneck: Science and education, 480.
  21. Ēmets, O. O., Ēmets, Ē. M. (2000). Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization. Dopov. Nats. Akad. Nauk Ukr. Mat. Prirodozn. Tekh. Nauki, 9, 105–109.

Published

2016-02-27

How to Cite

Пичугина, О. С., & Яковлев, С. В. (2016). Funcrional and analytic representations of the total permutation. Eastern-European Journal of Enterprise Technologies, 1(4(79), 27–38. https://doi.org/10.15587/1729-4061.2016.58550

Issue

Section

Mathematics and Cybernetics - applied aspects