КФУ. Карточка публикации. One algorithm for branch and bound method for solving concave optimization problem

КАЗАНСКИЙ
ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ

RUS

- EN
- 中文
- ES

ONE ALGORITHM FOR BRANCH AND BOUND METHOD FOR SOLVING CONCAVE OPTIMIZATION PROBLEM

Форма представления

Статьи в зарубежных журналах и сборниках

Год публикации

2016

Язык

английский

Авторы, сотрудники КФУ

Андрианова Анастасия Александровна, автор

Авторы, студенты КФУ

Корепанова Анна Алексеевна, автор

Халилова Ильмира Фаритовна, автор

Библиографическое описание на языке оригинала

One algorithm for branch and bound method for solving concave optimization problem A A Andrianova , A A Korepanova and I F Halilova // 11th International Conference on «Mesh methods for boundary-value problems and applications« IOP Publishing IOP Conf. Series: Materials Science and Engineering 158 (2016) 012005 doi:10.1088/1757-899X/158/1/012005

Аннотация

11th International Conference on «Mesh methods for boundary-value problems and applications« IOP Publishing IOP Conf. Series: Materials Science and Engineering

Ключевые слова

branch and bound method; concave programming problem

Название журнала

11th International Conference on «Mesh methods for boundary-value problems and applications« IOP Publishing IOP Conf. Series: Materials Science and Engineering

URL

http://iopscience.iop.org/article/10.1088/1757-899X/158/1/012005/pdf

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку

https://repository.kpfu.ru/?p_id=153568

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Андрианова Анастасия Александровна	ru_RU
dc.contributor.author	Корепанова Анна Алексеевна	ru_RU
dc.contributor.author	Халилова Ильмира Фаритовна	ru_RU
dc.date.accessioned	2016-01-01T00:00:00Z	ru_RU
dc.date.available	2016-01-01T00:00:00Z	ru_RU
dc.date.issued	2016	ru_RU
dc.identifier.citation	One algorithm for branch and bound method for solving concave optimization problem A A Andrianova , A A Korepanova and I F Halilova // 11th International Conference on «Mesh methods for boundary-value problems and applications« IOP Publishing IOP Conf. Series: Materials Science and Engineering 158 (2016) 012005 doi:10.1088/1757-899X/158/1/012005	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/?p_id=153568	ru_RU
dc.description.abstract	11th International Conference on «Mesh methods for boundary-value problems and applications« IOP Publishing IOP Conf. Series: Materials Science and Engineering	ru_RU
dc.description.abstract	The article describes the algorithm for branch and bound method for solving the concave programming problem, which is based on the idea of similarity the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem with another feasible set and reverse the sign of the objective function. To find the feasible set of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method. We formulate various branching techniques and discusses the construction of the lower objective function evaluations for the node of the decision tree. The article discusses the results of experiments of this algorithm for some famous test problems of a particular form.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject		ru_RU
dc.title	One algorithm for branch and bound method for solving concave optimization problem	ru_RU
dc.type	Статьи в зарубежных журналах и сборниках	ru_RU