An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint

European Journal of Operational Research

Volumn 162, Issue 2, 2005, Pages 503-513

  Isada, Yuriko ^a   James, Ross J W ^a   Nakagawa, Yuji ^a  

^a TEZUKAYAMA UNIVERSITY   (Japan)

Author keywords

Decision support systems; Discrete; Multiple objective programming; Nonlinear; Target problem

Indexed keywords

ALGORITHMS; DECISION MAKING; DECISION SUPPORT SYSTEMS; FINITE DIFFERENCE METHOD; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

MODULAR APPROACH (MA); MULTI-OBHJECTIVE COMBINATORIAL OPTIMIZATION (MOCO); MULTIPLE OBJECTIVE PROGRAMMING; TARGET PROBLEMS;

NONLINEAR PROGRAMMING;

EID: 9644278308     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.09.022     Document Type: Article

References (30)

1. Y. Nakagawa, A new method for discrete optimization problems, Electronics and Communications in Japan 73 (3) (1990) 99-106, Translated from Trans, of the Institute of Electronics, Information and Communication Engineers 73-A (3) (1990) 550-556 (in Japanese).
2. Y. Nakagawa, A new method for discrete optimization problems, Electronics and Communications in Japan 73 (3) (1990) 99-106, Translated from Trans, of the Institute of Electronics, Information and Communication Engineers 73-A (3) (1990) 550-556 (in Japanese).
3. K.M. Miettinen, Nonlinear multiobjective optimization, Kluwer Academic Publishers, Massachusetts, 1999.
4. W. Kuo, V.R. Prasad, An annotated overview of system-reliability optimization, IEEE Transactions on Reliability 49 (2) (2000) 176-187.
5. H. Isermann, Proper efficiency and the linear vector maximum problem, Operations Research 22 (1974) 189-191.
6. E.Q.V. Martins, On a multicriteria shortest path problem, European Journal Of Operational Research 16 (1984) 236-245.
7. L.M. Rasmaussen, Zero-one programming with multiple criteria, European Journal Of Operational Research 26 (1986) 83-95.
8. M. Ehrgott, X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spektrum 22 (2000) 425-460.
9. D.F. Jones, S.K. Mirrazavi, M. Tamiz, Multi-objective meta-heuristics: An overview of the current state-of-the-art, European Journal Of Operational Research 137 (2002) 1-9.
10. X. Gandibleux, A. Freville, Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case, Journal of Heuristics 6 (2000) 361-383.
11. K. Cho, S. Kim, An improved interactive hybrid method for linear multiobjective knapsack problem, Computer and Operations Research 24 (1997) 991-1003.
12. T.L. Morin, R.E. Marsten, Branch-and-bound strategies for dynamic programming, Operations Research 14 (4) (1976) 611-627.
13. M.E. Dyer, N. Kayal, J. Walker, A branch and bound algorithm for solving the multiple-choice knapsack problem, Journal of Computational Applied Mathematics 11 (1984) 231-249.
14. M.W. Cooper, The use of dynamic programming for the solution of a class of nonlinear programming problems, Naval Research Logistics Quarterly 27 (1981) 89-95.
15. M.J. Alves, J. Climaco, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problem, European Journal of Operational Research 117 (1999) 565-577.
16. M.J. Alves, J. Climaco, An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, European Journal of Operational Research 124 (2000) 478-494.
17. K.M. Bretthauer, B. Shetty, The nonlinear knapsack problem-algorithms and applications, European Journal of Operational Research 138 (2002) 459-472.
18. K.M. Bretthauer, B. Shetty, A pegging algorithm for the nonlinear resource allocation problem, Computers And Operations Research 5 (29) (2002) 505-527.
19. I. Miyaji, Y. Nakagawa, K. Ohno, Decision support system for the composition of the examination problem, European Journal of Operational Research 80 (1995) 130-138.
20. R.E. Marsten, T.L. Morin, A hybrid approach to discrete mathematical programming, Mathematical Programming 14 (1978) 21-40.
21. Y. Nakagawa, A. Iwasaki, Modular approach for solving nonlinear knapsack problems, IEICE Transactions on Fundamentals E 82-A (9) (1999) 1860-1864.
22. Y. Nakagawa, A reinforced surrogate constraints method for separable nonlinear integer programming, RIMS Kokyuroku of Kyoto University 1068 (1998) 194-202.
23. Y. Nakagawa, An improved surrogate constraints method for separable nonlinear integer programming, Journal of the Operations Research Society of Japan 46 (2) (2003) 145-163.
24. V.R. Prasad, W. Kuo, Reliability optimization of coherent system, IEEE Transactions on Reliability 49 (3) (2000) 323-330.
25. M. Hikita, Y. Nakagawa, K. Nakashima, H. Narihisa, Reliability optimization system by a surrogate-constraints algorithm, IEEE Transactions on Reliability 41 (3) (1992) 473-480.
26. M. Hikita, A. Iwasaki, Y. Nakagawa, An application of modular approach to non-linear programming problem, Electronics and Communications in Japan (in Japanese) J76-A (1) (1993) 64-71.
27. P. Sinha, A. Zoltners, The multiple-choice knapsack problem, Operations Research 27 (1979) 125-131.
28. Y. Nakagawa, Easy C programming, Asakura Shoten, Tokyo, 1996.
29. M. Sakawa, Optimization of Discrete System, Kitamiri Syuppan, Tokyo, 2000.
30. T.L. Saaty, How to make a decision: The analytic hierarchy process, European Journal of Operational Research 48 (1990) 9-26.