Abstract
In this paper, we deal with a resource allocation problem modeled as special case of 0-1 Quadratic Programs with joint probabilistic rectangular constraints (QPJPC) with normally distributed coefficients and independent matrix vector rows. We reformulate this problem as a completely positive problem. In addition, the optimal value of the latter problem converges to the optimal value of the original problem under certain conditions. Numerical experiments on randomly generated data 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
Disclaimer: 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.