Properties of Combinatorial Optimization Problems Over Polyhedral-Spherical Sets |
| |
| Authors: | S. V. Yakovlev O. S. Pichugina |
| |
| Affiliation: | 1.M. E. Zhukovsky National Aerospace University “Kharkiv Aviation Institute,”,Kharkiv,Ukraine;2.Kharkiv National University of Radio Electronics,Kharkiv,Ukraine |
| |
| Abstract: | The class of combinatorial optimization problems over polyhedral-spherical sets is considered. The results of theory of convex extensions are generalized to certain classes of functions defined on sphere-located and vertex-located sets. The original problem is equivalently formulated as a mathematical programming problem with convex both objective function and functional constraints. A numerical illustration and possible applications of the results to solving combinatorial optimization problems are given. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
