Decomposition of multiple criteria mathematical programming problems by dynamic programming (Q3887258): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3292915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vector Maximization Problem: Proper Efficiency and Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal vectors and multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel decomposition of nonlinear programming problems by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preference Order Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria decision making, 22nd International Meeting of TIMS, July 24--26, 1975, Kyoto/Japan / rank
 
Normal rank

Latest revision as of 09:21, 13 June 2024

scientific article
Language Label Description Also known as
English
Decomposition of multiple criteria mathematical programming problems by dynamic programming
scientific article

    Statements

    Decomposition of multiple criteria mathematical programming problems by dynamic programming (English)
    0 references
    0 references
    0 references
    1979
    0 references
    decomposition
    0 references
    efficient solutions
    0 references
    multiple criteria mathematical programming
    0 references
    separability
    0 references
    monotonicity
    0 references
    scalar criterion problems
    0 references
    reduction procedures
    0 references

    Identifiers