Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S10479-019-03216-Z / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10479-019-03216-Z / rank
 
Normal rank

Latest revision as of 05:22, 10 December 2024

scientific article
Language Label Description Also known as
English
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
scientific article

    Statements

    Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (English)
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    multiobjective optimization
    0 references
    robust optimization
    0 references
    semidefinite programming relaxations
    0 references
    SOS-convex polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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