A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402)

From MaRDI portal
Revision as of 19:13, 25 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
scientific article

    Statements

    A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2017
    0 references
    linear multiplicative
    0 references
    branch-and-bound
    0 references
    linear relaxation
    0 references
    global optimization
    0 references

    Identifiers