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.
Original language | English (US) |
---|---|
Pages (from-to) | 165-172 |
Number of pages | 8 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 52 |
DOIs | |
State | Published - Jun 1 2016 |
Externally published | Yes |
Keywords
- Completely positive program
- Joint probabilistic constraints
- Piecewise tangent approximation
- Quadratic program
- Resource allocation problems
- Stochastic programming
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics