Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Charles Audet, Pierre Hansen, Brigitte Jaumard — A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Charles Audet, Pierre Hansen, Brigitte Jaumard — A branch and cut algorithm for nonconvex quadratically constrained quadratic programming



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

Авторы: Charles Audet, Pierre Hansen, Brigitte Jaumard

Аннотация:

We present a branch and cut algorithm that yields in finite time, a globally -optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a branching tree using Reformulation-Linearization Techniques (RLT). To do so, four classes of linearizations (cuts), depending on one to three parameters, are detailed. For each class, we show how to select the best member with respect to a precise criterion. The cuts introduced at any node of the tree are valid in the whole tree, and not only within the subtree rooted at that node. In order to enhance the computational speed, the structure created at any node of the tree is flexible enough to be used at other nodes. Computational results are reported that include standard test problems taken from the literature. Some of these problems are solved for the first time with a proof of global optimality.


Язык: en

Рубрика: Computer science/

Тип: Статья

Статус предметного указателя: Неизвестно

ed2k: ed2k stats

Год издания: 2000

Количество страниц: 22

Добавлена в каталог: 28.06.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2021
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте