A new global optimization approach for convex multiplicative programming (Q972168): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2010.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976799446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome-space finite algorithm for solving linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the convex multiplicative programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a generalized convex multiplicative function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for minimizing the product of several convex functions on a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex multiplicative programming via quasiconcave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric successive underestimation method for convex multiplicative programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized linear multiplicative and fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Bicriterion Mathematical Programs / rank
 
Normal rank

Latest revision as of 20:14, 2 July 2024

scientific article
Language Label Description Also known as
English
A new global optimization approach for convex multiplicative programming
scientific article

    Statements

    A new global optimization approach for convex multiplicative programming (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    global optimization
    0 references
    convex multiplicative programming
    0 references
    outer approximation
    0 references
    branch-and-bound
    0 references
    outcome space
    0 references
    quasiconcave programming
    0 references
    numerical results
    0 references

    Identifiers