Photo from archive.org
The paper proposes a novel class of quadratically constrained convex reformulations (QCCR) for semi-continuous quadratic programming. We first propose the class of QCCR for the studied problem. Next, we discuss… Click to show full abstract
The paper proposes a novel class of quadratically constrained convex reformulations (QCCR) for semi-continuous quadratic programming. We first propose the class of QCCR for the studied problem. Next, we discuss how to polynomially find the best reformulation corresponding with the tightest continuous bound within this class. The properties of the proposed QCCR are then studied. Finally, preliminary computational experiments are conducted to illustrate the effectiveness of the proposed approach.
Keywords:
quadratically constrained;
continuous quadratic;
constrained convex;
convex reformulations;
semi continuous;
quadratic programming
Journal Title: Journal of Industrial and Management Optimization
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Industrial and Management Optimization
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!