Abstract
An algorithm for solving the continuous optimal sets partitioning problem with constrains for the centers location, which is based on usage of the optimal partitioning theory from n-dimensional Euclidean space for subsets and Shor’s r-algorithm modification is suggested for solving nonsmooth finite-dimensional optimization problems. The algorithm is illustrated with solving the model tasks using application software.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
