KFU. Card publication. One algorithm for branch and bound method for solving concave optimization problem

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

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

Form of presentation

Articles in international journals and collections

Year of publication

2016

��

��

Authors, employees of KFU

Andrianova Anastasiya Aleksandrovna, author

Authors, students KFU

Korepanova Anna Alekseevna, author

Khalilova Ilmira Faritovna, author

Bibliographic description in the original language

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

Annotation

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

Keywords

branch and bound method; concave programming problem

The name of the journal

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

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=153568&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Andrianova Anastasiya Aleksandrovna	ru_RU
dc.contributor.author	Korepanova Anna Alekseevna	ru_RU
dc.contributor.author	Khalilova Ilmira Faritovna	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/eng/?p_id=153568&p_lang=2	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	Articles in international journals and collections	ru_RU