Enumeration of all possibly optimal vertices with possible optimality degrees in linear programming problems with a possibilistic objective function

DOI10.1007/s10700-004-4201-5zbMath1059.90151OpenAlexW1991194532MaRDI QIDQ1771137

Masahiro Inuiguchi

Publication date: 7 April 2005

Published in: Fuzzy Optimization and Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10700-004-4201-5

zbMATH Keywords

enumerationsimplex methodpossibility measurepossibilistic linear programmingpossibly optimal solution

Mathematics Subject Classification ID

Linear programming (90C05) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (5)

Robust Optimization by Fuzzy Linear Programming ⋮ Extending and relating different approaches for solving fuzzy quadratic problems ⋮ Optimal solutions in optimization problem with objective function depending on fuzzy parameters ⋮ Duality in fuzzy linear programming with possibility and necessity relations ⋮ Bilevel linear programming with ambiguous objective function of the follower

Cites Work

• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• Relative modalities and their use in possibilistic linear programming
• Linear multiobjective programming
• Robust optimization under softness in a fuzzy linear programming problem
• Possible and necessary optimality tests in possibilistic linear programming problems
• Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• On stochastic linear programming distribution problems, stochastic technology matrix

This page was built for publication: Enumeration of all possibly optimal vertices with possible optimality degrees in linear programming problems with a possibilistic objective function