Choosing robust solutions in discrete optimization problems with fuzzy costs

Fuzzy Sets and Systems

Volumn 160, Issue 5, 2009, Pages 667-682

  Kasperski, Adam ^a   Kulej, Michał ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Discrete optimization; Fuzzy interval; Minmax; Minmax regret; Possibility theory; Robust optimization

Indexed keywords

DYNAMIC PROGRAMMING; LINEARIZATION; OPTIMIZATION; PARTICLE SIZE ANALYSIS; PROGRAMMING THEORY; SET THEORY;

DISCRETE OPTIMIZATION; FUZZY INTERVAL; MINMAX; MINMAX REGRET; POSSIBILITY THEORY; ROBUST OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 58149492833     PISSN: 01650114     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.fss.2008.09.001     Document Type: Article

References (32)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows, Theory, Algorithms and Applications (1993), Prentice-Hall, New Jersey
2. Aissi H., Bazgan C., and Vanderpooten D. Pseudo-polynomial time algorithms for min-max and min-max regret problems. The 5th Internat. Symp. on Operations Research and Its Applications (ISORA 2005), LNOR Vol. 5 (2005) 171-178
3. Aissi H., Bazgan C., and Vanderpooten D. Complexity of the min-max regret versions of cut problems. Proc. 16th Annu. Internat. Symp. on Algorithms and Computation (ISAAC 2005), Lecture Notes in Computer Science Vol. 3827 (2005), Springer, Berlin 789-798
4. Aissi H., Bazgan C., and Vanderpooten D. Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European J. Oper. Res. 179 2 (2007) 281-290
5. Aron I., and van Hentenryck P. On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32 1 (2004) 36-40
6. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Programming A 90 (2001) 263-272
7. Averbakh I., and Lebedev V. Interval data minmax regret network optimization problems. Discrete Appl. Math. 138 3 (2004) 289-301
8. Beyer H.G., and Sendhoff B. Robust optimization-a comprehensive survey. Comput. Methods Appl. Mech. Eng. 196 33-34 (2007) 3190-3218
9. Conde E. An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Programming A 100 (2004) 345-353
10. Dubois D., Fargier H., and Fortemps P. Fuzzy scheduling: modelling flexible constraints vs. coping with incomplete knowledge. European J. Oper. Res. 147 2 (2003) 231-252
11. Dubois D., and Prade H. Fuzzy Sets and Systems. Theory and Applications (1980), Academic Press, New York
12. Dubois D., and Prade H. Possibility Theory: An Approach To Computerized Processing of Uncertainty (1988), Plenum Press, New York
13. Garfinkel R.S., and Nemhauser G.L. Integer Programming (1972), Wiley, New York
14. GNU Linear Programming Kit 〈http://www.gnu.org/software/glpk/glpk.html〉 2008.
15. Herrera F., and Verdegay J.L. Fuzzy boolean programming problems with fuzzy costs: a general study. Fuzzy Sets and Systems 81 1 (1996) 57-76
16. ILOG CPLEX 9.0 User's Manual, ILOG, S.A., 2003
17. Inuiguchi M. On possibilistic/fuzzy optimization. 12th Internat. Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Lecture Notes in Artificial Intelligence Vol. 4529 (2007) 351-360
18. Inuiguchi M., and Ramik J. Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem. Fuzzy Sets and Systems 111 1 (2000) 3-28
19. Inuiguchi M., and Sakawa M. Possible and necessary optimality tests in possibilistic linear programming problems. Fuzzy Sets and Systems 67 1 (1994) 29-46
20. Inuiguchi M., and Sakawa M. Minimax regret solution to linear programming problems with an interval objective function. European J. Oper. Res. 86 3 (1995) 526-536
21. Inuiguchi M., and Sakawa M. Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test. Fuzzy Sets and Systems 78 2 (1996) 231-241
22. Inuiguchi M., and Sakawa M. Robust optimization under softness in a fuzzy linear programming problem. Internat. J. Approx. Reasoning 18 1-2 (1998) 21-34
23. Inuiguchi M., and Tanino T. Possibilistic linear programming with fuzzy if-then rule coefficients. Fuzzy Optim. Decision Making 1 1 (2002) 65-91
24. O.E. Karasan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, Industrial Engineering Department, Bilkent University, Turkey, 2001.
25. Kasperski A., and Zieliński P. An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inform. Process. Lett. 97 5 (2006) 177-180
26. Kasperski A., and Zieliński P. Using gradual numbers for solving fuzzy-valued combinatorial optimization problems. 12th Internat. Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Lecture Notes in Artificial Intelligence Vol. 4529 (2007) 656-665
27. Kouvelis P., and Yu G. Robust Discrete Optimization and Its Applications (1997), Kluwer Academic Publishers, Boston
28. Lawler E.L. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart and Winston, New York
29. Papadimitriou C., and Steiglitz K. Combinatorial Optimization. Algorithms and Complexity (1998), Dover Publications Inc., Mineola, New York
30. Yaman H., Karasan O.E., and Pinar M.C. The robust spanning tree problem with interval data. Oper. Res. Lett. 29 1 (2001) 31-40
31. Yu G. On the max-min 0-1 knapsack problem with robust optimization applications. Oper. Res. 44 2 (1996) 407-415
32. Yu G., and Yang J. On the robust shortest path problem. Comput. Oper. Res. 25 6 (1998) 457-468