A new approach to multiobjective programming with a modified objective function

Journal of Global Optimization

Volumn 27, Issue 4, 2003, Pages 485-495

  Antczak, Tadeusz ^a  

^a UNIVERSITY OF LODZ   (Poland)

Author keywords

Efficient point; Invex function with respect to ; Modified vector valued saddle point; Multiobjective programming; Vector valued Lagrange function

Indexed keywords

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; LAGRANGE MULTIPLIERS; VECTOR QUANTIZATION;

MODIFIED OBJECTIVE FUNCTION; MULTIOBJECTIVE PROGRAMMING; VECTOR VALUED SADDLE POINT;

GLOBAL OPTIMIZATION;

EID: 0242401837     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026080604790     Document Type: Article

References (23)

1. Beato-Moreno, A., Ruiz-Canales, P., Luque-Calvo, P.-L. and Blanquero-Bravo, R. (1998), Multiobjective quadratic problem: characterization of the efficient points, in: Crouzeix et al., J.P. (eds.), Generalized Convexity, Generalized Monotonicity, Kluwer Academic Publishers, Dordrecht.
2. Bazaraa, M.S., Sherali, H.D. and Shetty, C. M. (1991). Nonlinear Programming: Theory and Algorithms, John Wiley and Sons, New York.
3. Ben-Israel, A. and Mond, B. (1986), What is invexity?, Journal of Australian Mathematical Society Ser. B 28, 1-9.
4. Brumelle, S. (1981), Duality for multiple objective convex programs, Mathematics of Operations Research 6, 159-172.
5. Craven, B.D. (1981), Invex functions and constrained local minima, Bulletin of the Australian Mathematical Society 24, 357-366.
6. Craven, B.D. (1981), Vector-valued optimization. In: Schaible, S. and Ziemba, W.T. (eds.), Generalized Concavity in Optimization and Economics, Academic Press, New York, pp. 661-687.
7. Craven, B.D. and Glover, B.M. (1985), Invex functions and duality, Journal of Australian Mathematical Society Ser. A 39, 1-20.
8. Das, L.N. and Nanda, S. (1995), Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions, Optimization 34, 43-51.
9. Egudo, R.R. and Hanson, M.A. (1987), Multi-objective duality with invexity, Journal of Mathematical Analysis and Applications 126, 469-477.
10. Geoffrion, M.A. (1968), Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications 22, 613-630.
11. Giorgi, G. and Guerraggio, A. The notion of invexity in vector optimization: smooth and nonsmooth case. In: Crouzeix, J.P., Martinez-Legaz, J.E. and Volle, M. (eds.), Generalized Convexity, Generalized Monotonicity, Proceedings of the Fifth Symposium on Generalized Convexity, Luminy, France, 1997, Kluwer Academic Publishers.
12. Hanson, M.A. (1981), On sufficiency of the Kuhn-Tucker conditions, Journal of Mathematical Analysis and Applications 80, 545-550.
13. Ivanov, E.H. and Nehse, R. (1985), Some results on dual vector optimization problems, Optimization 4, 505-517.
14. Jeyakumar, V. and Mond, B (1992), On generalized convex mathematical programming, Journal of Australian Mathematical Society Ser. B 34 43-53.
15. Kanniappan, P. (1983), Necessary conditions for optimality of nondifferentiable convex multiobjective programming, Journal of Optimization Theory and Applications 40, 167-174.
16. Mangasarian, O.L. (1969), Nonlinear Programming, McGraw-Hill, New York.
17. Pareto, V. (1986), Cours de Economie Politique, Rouge, Lausanne, Switzerland.
18. Ruiz-Canales, P. and Rufián-Lizana, A. (1995), A characterization of weakly efficient points, Mathematical Programming 68, 205-212.
19. Singh, C. (1987), Optimality Conditions in multiobjective differentiable programming, Journal of Optimization Theory and Applications 53, 115-123.
20. Tanino, T. and Sawaragi, Y. (1979), Duality theory in multiobjective programming, Journal of Optimization Theory and Applications 27, 509-529.
21. Weir, T., Mond, B. and Craven, B.D. (1986), On duality for weakly minimized vector valued optimization problems, Optimization 17, 711-721.
22. Weir, T. (1988) A note on invex functions and duality in multiple objective optimization, Opsearch 25, 98-104.
23. Weir, T. and Mond, B. (1989), Generalized convexity and duality in multiple objective programming, Bulletin of the Australian Mathematical Society 39, 287-299.