Interval linear programming techniques in constraint programming and global optimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282493" target="_blank" >RIV/00216208:11320/14:10282493 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-04280-0_6" target="_blank" >http://dx.doi.org/10.1007/978-3-319-04280-0_6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-04280-0_6" target="_blank" >10.1007/978-3-319-04280-0_6</a>

Result language
angličtina
Original language name
Interval linear programming techniques in constraint programming and global optimization
Original language description
We consider a constraint programming problem described by a system of nonlinear equations and inequalities; the objective is to tightly enclose all solutions. First, we linearize the constraints to get an interval linear system of equations and inequalities. Then, we adapt techniques from interval linear programming to find a polyhedral relaxation to the solution set. The linearization depends on a selection of the relaxation center; we discuss various choices and give some recommendations. The overallprocedure can be iterated and thus serves as a contractor.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)