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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
