A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY (Q5076115): 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: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood estimates for multinomial probabilities via geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric programming problems having negative degrees of difficulty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732201 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.17654/dm026020221 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3139027909 / rank
 
Normal rank

Latest revision as of 08:36, 30 July 2024

scientific article; zbMATH DE number 7527401
Language Label Description Also known as
English
A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY
scientific article; zbMATH DE number 7527401

    Statements

    A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2022
    0 references
    operations research
    0 references
    mathematical programming
    0 references
    nonlinear programming
    0 references
    geometric programming
    0 references
    negative degree of difficulty
    0 references
    global optimal solution
    0 references

    Identifiers