Rigorous verification of feasibility
| Autor: | Ferenc Domes, Arnold Neumaier |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Scheme (programming language)
Mathematical optimization Control and Optimization Branch and bound Applied Mathematics Management Science and Operations Research Constraint satisfaction Solver Computer Science Applications Interval arithmetic Numerical tests computer Global optimization Algorithm Constraint satisfaction problem Mathematics computer.programming_language |
| Zdroj: | Journal of Global Optimization. 61:255-278 |
| ISSN: | 1573-2916 0925-5001 |
| Popis: | This paper considers the problem of finding and verifying feasible points for constraint satisfaction problems (CSPs), including those with uncertain coefficients. The main part is devoted to the problem of finding a narrow box around an approximately feasible solution for which it can be rigorously and automatically proved that it contains a feasible solution. Some examples demonstrate difficulties when attempting verification. We review some existing methods and present a new method for verifying the existence of feasible points of CSPs in an automatically determined narrow box. Numerical tests within GloptLab, a solver developed by the authors, show how the different methods perform. Also discussed are the search for approximately feasible points and the use of approximately feasible points within a branch and bound scheme for constraint satisfaction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink