Submit Paper

Article Processing Fee

Pay Online

           

Crossref logo

  DOI Prefix   10.20431


 

International Journal of Research Studies in Computer Science and Engineering
Volume 4, Issue 4, 2017, Page No: 72-80
doi:dx.doi.org/10.20431/2349-4859.0404009

Solving Continual Two-Stage Problems of Optimal Partition of Sets

Zelentsov D.1,Us S.2,Koryashkina L.3,Stanina O.4

1.Department of System Analysis and Management, National Mining University, Dnipro, Ukraine.
2.Department of Information Systems, Ukrainian State University of Chemical Technology, Dnipro, Ukraine.

Citation :Zelentsov D.,Us S.,Koryashkina L.,Stanina O., Solving Continual Two-Stage Problems of Optimal Partition of Sets International Journal of Research Studies in Computer Science and Engineering 2017,4(4) : 72-80

Abstract

The paper considers two-stage location-allocation problem being a certain case of a continual multistage problem of optimal partition of sets with the additional couplings. It has been demonstrated that solution of two-stage optimal partition of sets with restrictions to the capacities of enterprises being arranged is reduced to the minimization of nonsmooth function of finite quantity of variables with simultaneous solving a problem of linear programming of a transport type. The developed numerical algorithm synthesizing both Shor's algorithm and a method of potentials has been described. The results of model problems solution have been represented.


Download Full paper: Click Here