Skip to main content
SpringerLink
Log in

Convex Extensions in Combinatorial Optimization and Their Applications

  • Chapter
  • First Online:
Book cover Optimization Methods and Applications

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 130))

Abstract

This research focuses on problems of combinatorial optimization necessary for mapping combinatorial sets into arithmetic Euclidean space. The analysis shows that there is a class of vertex-located sets that coincide with the set of vertices within their convex hull. The author has proved the theorems on the existence of convex, strongly convex, and differentiable extensions for functions defined on vertex-located sets. An equivalent problem of mathematical programming with convex objective function and functional constraints has been formulated. The author has studied the properties of convex function extremes on vertex-located sets. The research contains the examples of vertex-located combinatorial sets and algorithms for constructing convex, strongly convex, and differentiable extensions for functions defined on these sets. The conditions have been formulated that are sufficient for a minimum value of functions, as well as lower bounds of functions have been defined on the permutation set. The results obtained can be well used for developing new methods of combinatorial optimization.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Balinski, M.L., Hoffman, A.J.: Polyhedral Combinatorics: Dedicated to the Memory of D.R. Fulkerson. Elsevier, New York (1978)

    Google Scholar 

  2. Bohn, A., et al.: Enumeration of 2-Level Polytopes. Algorithms ES, pp. 191–202. Springer, Berlin/Heidelberg (2015)

    Google Scholar 

  3. Brualdi, R.A.: Combinatorial Matrix Classes. Cambridge University Press, Cambridge (2006)

    Google Scholar 

  4. Donets, G., Kolechkina, L.: Extremal Problems on Combinatorial Configurations. RVV PUET, Poltava (2011) (in Ukrainian)

    Google Scholar 

  5. Grebennik, I.V.: Combinatorial set of permutations of tuples and its properties. Radioelectron. Comput. Sci. Manag. 1, 92–98 (2005) (in Russian)

    Google Scholar 

  6. Grebennik, I.V.: Properties of classes of composite images of combinatorial sets mapped into Euclidean space. Radioelectron. Inform. 1, 66–70 (2005) (in Russian)

    Google Scholar 

  7. Grebennik I.V.: Description and generation of permutations containing cycles. Cybern. Syst. Anal. 6, 97–105 (2010)

    Google Scholar 

  8. Green, R.M.: Homology representations arising from the half cube, II. J. Comb. Theory 117(8), 1037–1048 (2010)

    Google Scholar 

  9. Grichik, V.V., Kiselyova, O.M., Yakovlev S.V.: Mathematical Methods of Optimization and Intelligent Computer Technologies for Modeling Complex Systems with Consideration of Spatial Shapes of Objects. Nauka i Osvita, Donetsk (2012) (in Ukrainian)

    Google Scholar 

  10. Hulianytskyi, L.F., Mulesa, O.Y.: Applied Methods of Combinatorial Optimization. Kyiv University Press, Kyiv (2016) (in Ukrainian)

    Google Scholar 

  11. Hulianytskyi, L.F., Sergienko, I.V.: Metaheuristic method of deformed polyhedron in combinatorial optimization. Cybern. Syst. Anal. 6, 70–79 (2007)

    Google Scholar 

  12. Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lu, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58–81 (2014)

    Google Scholar 

  13. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin/New York (2002)

    Google Scholar 

  14. Murray, W., Ng, K.-M.: An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. 47(2), 257–288 (2008)

    Google Scholar 

  15. Papadimitrou, H., Steiglitz, K.: Combinatorial Optimization. Algorithms and Complexity. Dover, Mineola (1998)

    Google Scholar 

  16. Pardalos, P.M, Prokopyev, O.A., Busygin, S.: Continuous approaches for solving discrete optimization problems. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds.) Handbook on Modelling for Discrete Optimization, pp. 1–39. Springer, New York (2006)

    Google Scholar 

  17. Pardalos, P.M., Du, D., Graham, R.L. (eds.): Handbook of Combinatorial Optimization. Springer, New York (2013)

    Google Scholar 

  18. Pichugina, O.S., Yakovlev, S.V.: Continuous approaches to the unconstrained binary quadratic problems. In: Blair, J. et al. (eds.) Mathematical and Computational Approaches in Advancing Modern Science and Engineering, pp. 689–700. Springer, Cham (2016)

    Google Scholar 

  19. Pichugina, O.S., Yakovlev, S.V.: Convex extensions and continuous functional representations in optimization with their applications. J. Coupled Syst. Multiscale Dyn. 4(2), 129–152 (2016)

    Google Scholar 

  20. Pichugina, O.S., Yakovlev, S.V.: Functional and analytic representations of the general permutations. East. Eur. J. Enterp. Technol. 1(4), 27–38 (2016)

    Google Scholar 

  21. Pichugina, O.S., Yakovlev, S.V.: On continuous representations and functional continuations in combinatorial optimization. Cybern. Syst. Anal. 52(6), 102–113 (2016)

    Google Scholar 

  22. Pichugina, O.S., Yakovlev, S.V.: Continuous representation techniques in combinatorial optimization. IOSR J. Math. 13(2), 12–25 (2017), Ver.V

    Google Scholar 

  23. Postnikov, A.: Permutohedra, Associahedra and Beyond. Int. Math. Res. Notices 6, 1026–1106 (2009)

    Google Scholar 

  24. Semenova, N.V., Kolechkina, L.M.: Vector Problems of Discrete Optimization on Combinatorial Sets: Methods for Their Investigation and Solutions. Nauk. Dumka, Kyiv (2009) (in Ukrainian)

    Google Scholar 

  25. Sergienko, I.V.: Methods of Optimization and Systems Analysis for Problems of Transcomputational Complexity. Springer, New York (2012)

    Google Scholar 

  26. Sergienko I.V., Shylo, V.P.: Discrete Optimization Problems. Nauk. Dumka, Kyiv (2003) (in Russian)

    Google Scholar 

  27. Sergienko, I.V., Shylo, V.P.: Problems of discrete optimization: complex problems and basic approaches to their solution. Cybern. Syst. Anal. 42(4), 3–25 (2006)

    Google Scholar 

  28. Sergienko, I.V., Hulianytskyi, L.F., Sirenko, S.I.: Classification of applied methods of combinatorial optimization. Cybern. Syst. Anal. 45, 71–83 (2009)

    Google Scholar 

  29. Solymosi, T.: The kernel is in the least core for permutation games. Cent. Eur. J. Oper. Res. 23, 795–809 (2015)

    Google Scholar 

  30. Stoyan, Y.G.: Some Properties of Special Combinatorial Sets. Academy of Sciences of Ukraine, Inst. Probl. Mashinostr., Kharkiv (1980) (in Russian)

    Google Scholar 

  31. Stoyan, Y.G., Grebennik, I.V.: Combinatorial species for the enumeration of combinatorial configurations with special properties. Dokl. Ukr. Acad. Sci. A(7), 28–32 (2010) (in Russian)

    Google Scholar 

  32. Stoyan, Y.G., Yakovlev, S.V.: Mathematical Models and Optimization Methods of Geometric Design. Nauk. Dumka, Kyiv (1986) (in Russian)

    Google Scholar 

  33. Stoyan, Y.G., Yakovlev, S.V.: Construction of convex and concave functions on the permutation polyhedron. Dokl. Acad. Sci. USSR A(5), 66–68 (1988) (in Russian)

    Google Scholar 

  34. Stoyan, Y.G., Yakovlev, S.V.: Properties of convex functions on a permutation polyhedron. Dokl. Acad. Sci. USSR A(3), 69–72 (1988) (in Russian)

    Google Scholar 

  35. Stoyan, Y.G. Yemets, O.O.: Theory and Methods of Euclidean Combinatorial Optimization. ISSE, Kyiv (1993) (in Ukrainian)

    Google Scholar 

  36. Stoyan, Y.G., Yakovlev, S.V., Parshin, O.V.: Quadratic optimization on combinatorial sets in Rn. Cybern. Syst. Anal. 27(4), 561–567 (1991)

    Google Scholar 

  37. Stoyan, Y.G., Yakovlev, S.V., Yemets, O.A., Valuyskaya, O.A.: Construction of convex continuations for functions defined on hypersphere. Cybern. Syst. Anal. 34(2), 176–184 (1998)

    Google Scholar 

  38. Stoyan, Y.G. Yemets, O.O., Yemets, E.M.: Optimization for Arrangements: Theory and Methods. Poltava (2005) (in Ukrainian)

    Google Scholar 

  39. Weisstein, E.W.: CRC Concise Encyclopedia of Mathematics. CRC Press, Boca Raton (2002)

    Book  MATH  Google Scholar 

  40. Yakovlev, S.V.: Estimates of the minimum of convex functions on Euclidean combinatorial sets. Cybernetics 3, 89–97 (1989)

    MathSciNet  Google Scholar 

  41. Yakovlev, S.V.: Theory of convex extensions of functions on the vertices of a convex polyhedron. J. Comp. Math. Math. Phys. 34(7), 1112–1119 (1994) (in Russian)

    Google Scholar 

  42. Yakovlev, S.V., Grebennik, I.V.: Localization of solutions of some problems of nonlinear integer optimization. Cybern. Syst. Anal. 29(5), 419–426 (1993)

    MATH  Google Scholar 

  43. Yakovlev, S.V., Valuiskaya O.A.: Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints. Ukr. Math. J. 53(9), 1535–1545 (2001)

    Article  Google Scholar 

  44. Yemelichev, V.A., Kovalev, M.M., Kravtsov, M.K.: Polytopes, Graphs and Optimization. Cambridge University Press, Cambridge (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Aerospace University “Kharkiv Aviation Institute”, Kharkiv, Ukraine

    Sergey Yakovlev

Authors
  1. Sergey Yakovlev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey Yakovlev .

Editor information

Editors and Affiliations

  1. Industrial & Systems Engineering, Texas A&M University, College Station, Texas, USA

    Sergiy Butenko

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  3. Methods of Discrete Optimization, V.M. Glushkov Institute of Cybernetics, Kyiv, Ukraine

    Volodymyr Shylo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Yakovlev, S. (2017). Convex Extensions in Combinatorial Optimization and Their Applications. In: Butenko, S., Pardalos, P., Shylo, V. (eds) Optimization Methods and Applications . Springer Optimization and Its Applications, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-68640-0_27

Download citation

Publish with us

Policies and ethics

Search

Navigation