Choosing robust solutions in discrete optimization problems with fuzzy costs

Authors:
Adam Kasperski;Michał Kulej
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland;Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
Fuzzy Sets and Systems
Year:
2009

Citing 14
Cited 4

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Possible and necessary optimality tests in possibilistic linear programming problems

Fuzzy Sets and Systems - Special issue on operations research
Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test

Fuzzy Sets and Systems - Special issue on fuzzy multiple criteria decision making
Fuzzy Boolean programming problems with fuzzy costs: a general study

Fuzzy Sets and Systems - Special issue on fuzzy optimization
On the robust shortest path problem

Computers and Operations Research
Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem

Fuzzy Sets and Systems - Fuzzy mathematical programming
Fuzzy Sets and Systems: Theory and Applications

Fuzzy Sets and Systems: Theory and Applications
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion

Mathematical Programming: Series A and B
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
Complexity of the min-max (regret) versions of cut problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
The robust spanning tree problem with interval data

Operations Research Letters

Fast Local Search for Fuzzy Job Shop Scheduling

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Surrogate relaxation of a fuzzy multidimensional 0-1 knapsack model by surrogate constraint normalization rules and a methodology for multi-attribute project portfolio selection

Engineering Applications of Artificial Intelligence
Robust possibilistic programming for socially responsible supply chain network design: A new approach

Fuzzy Sets and Systems
A robust lot sizing problem with ill-known demands

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.20

Visualization

Abstract

In this paper a wide class of discrete optimization problems, which can be formulated as a 0-1 linear programming problem is discussed. It is assumed that the objective function costs are not precisely known. This uncertainty is modeled by specifying a finite set of fuzzy scenarios. Under every fuzzy scenario the costs are given as fuzzy intervals. Possibility theory is then applied to chose a solution in such a problem and mixed integer linear programming models are proposed to compute this solution.