Reversed geometric programming: A branch-and-bound method involving linear subproblems (Q1141082): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solution of generalized geometric programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of geometric programming test problems and their solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric programming with signomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Easy Primal Method for Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4777059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified reduced gradient method for a class of nondifferentiable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solutions of mathematical programs with intrinsically concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained derivatives and equilibrium conditions in generalized geometric programming / rank
 
Normal rank

Latest revision as of 04:19, 13 June 2024

scientific article
Language Label Description Also known as
English
Reversed geometric programming: A branch-and-bound method involving linear subproblems
scientific article

    Statements

    Reversed geometric programming: A branch-and-bound method involving linear subproblems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    reversed geometric programming
    0 references
    global optimization
    0 references
    branch-and-bound method
    0 references
    global solution
    0 references
    general polynomial programs
    0 references
    reversed posynomial program
    0 references
    cutting plane algorithm
    0 references
    linear subproblems
    0 references
    computational evidence
    0 references

    Identifiers