Abstract

This note reports a correction and clarifies the results presented in [2]. The third author of this corrigendum is not an author of the paper [2]. In the original publication, Theorem 28 (Sect. 4.2.1, p. 410) states that “The probabilistically constrained problem PMRTM can be reformulated as the quadratic integer optimization problem QDE.” This statementmust be corrected, since problemQDE is in fact an inner approximation of the chance-constrained problem PMRTM, and the equivalence between QDE and PMRTM can only be claimed under the specific settings presented below in the modified Theorem 28. In part (ii) of Theorem 28 in [2, p. 411], it is shown that any feasible solution for the chance-constrained problem PMRTM defined by a p-sufficient recombination ωk is also feasible for the reformulated problem QDE. While that statement is correct, this, along with the fact any feasible solution of QDE is feasible for PMRTM (part

Full Text
Paper version not known

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

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.