A computational study of methods for solving polynomial geometric programs (Q1218172): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Geometric programming with signomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condensing generalized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained maximization of posynomials by geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Search: A Method for Solving Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596182 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00934095 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091021473 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
A computational study of methods for solving polynomial geometric programs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references