Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
by
Qiu, Yuzhou
, Yıldırım, E. Alper
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
by
Qiu, Yuzhou
, Yıldırım, E. Alper
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
Journal Article
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
2025
Request Book From Autostore
and Choose the Collection Method
Overview
We study linear programming relaxations of nonconvex quadratic programs given by the reformulation–linearization technique (RLT), referred to as RLT relaxations. We investigate the relations between the polyhedral properties of the feasible regions of a quadratic program and its RLT relaxation. We establish various connections between recession directions, boundedness, and vertices of the two feasible regions. Using these properties, we present a complete description of the set of instances that admit an exact RLT relaxation. We then give a thorough discussion of how our results can be converted into simple algorithmic procedures to construct instances of quadratic programs with exact, inexact, or unbounded RLT relaxations.
MBRLCatalogueRelatedBooks
Related Items
Related Items
We currently cannot retrieve any items related to this title. Kindly check back at a later time.
This website uses cookies to ensure you get the best experience on our website.