Separable concave minimization via partial outer approximation and branch and bound (Q2277369): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q229676
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Harold P. Benson / rank
 
Normal rank

Revision as of 09:30, 11 February 2024

scientific article
Language Label Description Also known as
English
Separable concave minimization via partial outer approximation and branch and bound
scientific article

    Statements

    Separable concave minimization via partial outer approximation and branch and bound (English)
    0 references
    1990
    0 references
    The paper presents an algorithm for globally minimizing a separable, concave function over a compact convex set. The algorithm combines partial outer approximation and branch-and-bound in a manner specifically designed to exploit the separability of the objective function. The major computational effort required is to solve linear programming problems at some nodes of the branch-and-bound tree, and to solve simple univariate minimization problems in some iterations. The outer approximation used in the algorithm is partial in the sense that many of the cutting planes that it creates are not added as constraints in a number of the linear programming subproblems solved during the branch-and-bound search.
    0 references
    separable, concave function
    0 references
    partial outer approximation
    0 references
    branch-and- bound
    0 references
    cutting planes
    0 references
    0 references

    Identifiers