CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
One algorithm for branch and bound method for solving concave optimization problem
Authors
Andrianova A.
Halilova I.
Korepanova A.
Publication date
1 March 2020
Publisher
Abstract
© Published under licence by IOP Publishing Ltd.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
Similar works
Full text
Available Versions
National Open Repository Aggregator (NORA)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:rour.neicon.ru:rour/184407
Last time updated on 04/04/2020