A path following method for box-constrained multiobjective optimization with applications to goal programming problems

Mathematical Methods of Operations Research

Volumn 58, Issue 1, 2003, Pages 69-85

  Recchioni, Maria Cristina ^a  

^a Istituto di Teoria delle Decisioni e Finanza Innovativa   (Italy)

Author keywords

Dynamical systems; Goal programming; Multiobjective optimization problems; Pareto optimal fronts; Path following methods

Indexed keywords

COMPUTATIONAL METHODS; DIFFERENTIAL EQUATIONS; FUNCTIONS; INFORMATION ANALYSIS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

DYNAMICAL SYSTEMS; GOAL PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION PROBLEMS; PARETO-OPTIMAL FRONTS; PATH FOLLOWING METHODS;

PARETO PRINCIPLE;

EID: 21044451149     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860300281     Document Type: Article

References (23)

1. Aghezzaf B, Hachimi M (2000) Generalized Invexity and duality in multiobjective programming problems. JOGO 18:91-101
2. Das I, Dennis JE (1997) A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multi-criteria optimization problems. Struct. Optim. 14:63-69
3. Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating Pareto optimal points in nonlinear multicriteria optimization problems. Siam J. Optim. 8:631-657
4. Deb K (1999) Multi-objective genetic algorithms: Problem Difficulties and Construction of test problems. Evolutionary Comput. J. 7:205-230
5. Deb K (2001) Nonlinear goal programming using multi-objective genetic algorithms. J. Oper. Res. Soc. 52:291-302
6. Fliege J, Svaiter BF (2000) Steepest descent methods for multicriteria optimization. Math. Meth. Oper. Res. 51:479-494
7. Fonseca MC, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization. Proceedings of the Fifth International Conference on Genetic Algoritms, 416-423
8. Geoffrin AM (1968) Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22:618-630
9. Giorgi G, Guerraggio A (1998) The notion of invexity in vector optimization: smooth and nonsmooth case. In: Crouzeix JP, Martinez Legaz JE, Volle M (eds) Nonconvex optimization and its applications 27. Kluwer Academic Publishers, Dordrecht, pp. 389-405
10. Hanne T (2000) Global multiobjective optimization using evolutionary algorithms. J. Heuristics 6:347-360
11. Herzel S, Recchioni MC, Zirilli F (1991) A quadratically convergent method for linear programming. Linear Algebra and its Appl. 152:255-289
12. Hillermeier C (2001) Generalized homotopy approach to multiobjective optimization. JOTA 110:557-583
13. La Salle J, Lefschetz S (1961) Stability by Lyapounov's Direct Method. Academic Press, New York
14. Levy AV, Montalvo A (1985) The tunneling algorithm for the global minimization of functions. SIAM J. Sci. Stat. Comput. 6:15-29
15. Luc DT (1988) Theory of vector optimization. Springer-Verlag, Berlin
16. Pacelli G, Recchioni MC (2000) Monotone variable - metric algorithm for linearly constrained nonlinear programming. JOTA 104:255-279
17. Pacelli G, Recchioni MC (2001) An interior point algorithm for global optimal solutions and KKT points. Optim. Methods and Software 15:225-256
18. Perko L (1991) Differential Equations and Dynamical Systems. Texts in Applied Mathematics 7, Springer-Verlag, New York
19. Recchioni MC, Scoccia A (2000) A stochastic algorithm for constrained global optimization. JOGO 16:257-270
20. Sawaragi Y, Nakayama H, Tanino T (1985) Theory of multiobjective optimization. Mathematics in Science and Engineering 176, Academic Press, Orlando, FL
21. Schandl B, Klamroth K, Wiecek MM (2002) Introducing oblique norms into multiple criteria programming. JOGO 23:81-97
22. Srinivas N, Deb K (1994) Multi-objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Comput. J. 2:221-248
23. Tind J, Wiecek MM (1999) Augmented Lagrangian and Tchebycheff approaches in multiple objective programming. JOGO 14:251-266