On possibilistic linear programming (Q1821684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets and systems. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy random variables - I. Definitions and theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming under randomness and fuzziness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy contactability and fuzzy variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective decision-making using fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets as a basis for a theory of possibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: DESCRIPTION AND OPTIMIZATION OF FUZZY SYSTEMS / rank
 
Normal rank

Latest revision as of 18:31, 17 June 2024

scientific article
Language Label Description Also known as
English
On possibilistic linear programming
scientific article

    Statements

    On possibilistic linear programming (English)
    0 references
    1986
    0 references
    The problem of processing and combining possibilistic information in the scope of linear programming is approached. As apparatus to cope with this problem, we use the concepts of 'more possible value', '\(\alpha\)-possibly feasible action'. Issues regarding the feasibility of the resulting deterministic programs as well as the characterization of their optimal solutions are also discussed.
    0 references
    more possible value
    0 references
    \(\alpha \)-possibly feasible action
    0 references

    Identifiers