Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897668 | European Journal of Operational Research | 2014 | 7 Pages |
Abstract
The mixed integer quadratic programming (MIQP) reformulation by Zheng, Sun, Li, and Cui (2012) for probabilistically constrained quadratic programs (PCQP) recently published in EJOR significantly dominates the standard MIQP formulation (Ruszczynski, 2002, Benati and Rizzi, 2007) which has been widely adopted in the literature. Stimulated by the dimensionality problem which Zheng et al. (2012) acknowledge themselves for their reformulations, we study further the characteristics of PCQP and develop new MIQP reformulations for PCQP with fewer variables and constraints. The results from numerical tests demonstrate that our reformulations clearly outperform the state-of-the-art MIQP in Zheng et al. (2012).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yong Hsia, Baiyi Wu, Duan Li,