Solving a class of multiplicative programming problems via \(C\)- programming (Q1892609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998396 / 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: C-programming and the minimization of pseudolinear and additive concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a class of fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method as a global optimizer: A \(C\)-programming perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001824 / rank
 
Normal rank

Latest revision as of 14:58, 23 May 2024

scientific article
Language Label Description Also known as
English
Solving a class of multiplicative programming problems via \(C\)- programming
scientific article

    Statements

    Solving a class of multiplicative programming problems via \(C\)- programming (English)
    0 references
    0 references
    0 references
    0 references
    13 May 1996
    0 references
    0 references
    multiplicative objective function
    0 references
    parametric programming
    0 references
    global optimization
    0 references
    product of several convex functions
    0 references
    \(C\)-programming
    0 references