On possibilistic linear programming
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.
scientific article; zbMATH DE number 3999648