Choosing robust solutions in discrete optimization problems with fuzzy costs
From MaRDI portal
Publication:1037888
DOI10.1016/j.fss.2008.09.001zbMath1173.90596OpenAlexW2003780271MaRDI QIDQ1037888
Publication date: 17 November 2009
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2008.09.001
Mixed integer programming (90C11) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (8)
Robustness-based approach for fuzzy multi-objective problems ⋮ Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop ⋮ $$\beta $$ -Robustness Approach for Fuzzy Multi-objective Problems ⋮ Robust possibilistic programming for socially responsible supply chain network design: a new approach ⋮ A robust lot sizing problem with ill-known demands ⋮ A fuzzy robustness measure for the scheduling of commissioned product development projects ⋮ A novel robust fuzzy stochastic programming for closed loop supply chain network design under hybrid uncertainty ⋮ A polymorphic uncertain equilibrium model and its deterministic equivalent formulation for decentralized supply chain management
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
- Possibilistic linear programming with fuzzy if-then rule coefficients
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Robust optimization - a comprehensive survey
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Fuzzy sets and systems. Theory and applications
- Robust discrete optimization and its applications
- Fuzzy boolean programming problems with fuzzy costs: A general study
- Minimax regret solution to linear programming problems with an interval objective function
- On the robust shortest path problem.
- On the complexity of the robust spanning tree problem with interval data
- Robust optimization under softness in a fuzzy linear programming problem
- Interval data minmax regret network optimization problems
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- 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
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- On Possibilistic/Fuzzy Optimization
- Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
- Algorithms and Computation
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
This page was built for publication: Choosing robust solutions in discrete optimization problems with fuzzy costs
