Necessity measure optimization in linear programming problems with fuzzy polytopes
From MaRDI portal
Publication:2455529
DOI10.1016/j.fss.2007.04.004zbMath1137.90757OpenAlexW2072660142MaRDI QIDQ2455529
Publication date: 25 October 2007
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2007.04.004
semi-infinite programmingbisection methodnecessity measurerelaxation procedurefuzzy polytopePossibilistic linear programming
Linear programming (90C05) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Semi-infinite programming (90C34)
Related Items
Optimality conditions for fuzzy optimization in several variables under generalized differentiability, Fuzzy vectors as a tool for modeling uncertain multidimensional quantities, Applying the concept of null set to solve the fuzzy optimization problems, On starshaped fuzzy sets, Application of fuzzy minimum cost flow problems to network design under uncertainty, An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Possibilistic linear programming with fuzzy if-then rule coefficients
- Relative modalities and their use in possibilistic linear programming
- Fuzzy sets and systems. Theory and applications
- Modality constrained programming problems: A unified approach to fuzzy mathematical programming problems in the setting of possibility theory
- Infinitely constrained optimization problems
- Fuzzy linear programming and applications
- Portfolio selection under independent possibilistic information
- The advantages of fuzzy optimization models in practical use
- Fuzzy linear programming with interactive uncertain parameters
- Oblique fuzzy vectors and their use in possibilistic linear programming
- A possibilistic linear program is equivalent to a stochastic linear program in a special case
- Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem